Skip to main content

Home / Mathematics (thesaurus)

Mathematics (thesaurus)

mathematical analysis > calculus > sequence > integer sequence > Padovan sequence

Preferred term

Padovan sequence

In number theory, the Padovan sequence is the sequence of integers P(n) defined by the initial values
${\\displaystyle P(0)=P(1)=P(2)=1,}$
and the recurrence relation
${\\displaystyle P(n)=P(n-2)+P(n-3).}$
The first few values of P(n) are
1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37, 49, 65, 86, 114, 151, 200, 265, ... (sequence A000931 in the OEIS)
A Padovan prime is a Padovan number that is prime. The first Padovan primes are:
2, 3, 5, 7, 37, 151, 3329, 23833, 13091204281, 3093215881333057, 1363005552434666078217421284621279933627102780881053358473, 1558877695141608507751098941899265975115403618621811951868598809164180630185566719, ... (sequence A100891 in the OEIS).

(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Padovan_sequence)

integer sequence

plastic number

suite de Padovan

French

URI

http://data.loterre.fr/ark:/67375/PSR-KCQX6LVG-M

Download this concept:

RDF/XML TURTLE JSON-LD Created 7/26/23, last modified 10/18/24