Padovan sequence


Construct a recurrence relation with initial terms a0=1, a1=0, a2=0 and an=an-3+an-2 for n>2. The first few terms of the sequenceMathworldPlanetmath defined by this recurrence relation are: 1, 0, 0, 1, 0, 1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37, 49, 65, 86, 114, 151 (listed in A000931 of Sloane’s OEIS). This is the Padovan sequenceMathworldPlanetmath, named after mathematician Richard Padovan. Its generating function is

G(a(n);x)=1-x21-x2-x3

.

It has been observed that in taking seven consecutive terms of this sequence, the sum of the squares of the first, third and seventh terms is equal to the sum of the squares of the second, fourth, fifth and sixth terms.

The nth Padovan number asymptotically matches the nth power of the plastic constant.

Title Padovan sequence
Canonical name PadovanSequence
Date of creation 2013-03-22 16:37:21
Last modified on 2013-03-22 16:37:21
Owner PrimeFan (13766)
Last modified by PrimeFan (13766)
Numerical id 4
Author PrimeFan (13766)
Entry type Definition
Classification msc 11B39