|
|
A010903
|
|
Pisot sequence E(3,13): a(n) = floor(a(n-1)^2/a(n-2) + 1/2).
|
|
3
|
|
|
3, 13, 56, 241, 1037, 4462, 19199, 82609, 355448, 1529413, 6580721, 28315366, 121834667, 524227237, 2255632184, 9705479209, 41760499493, 179686059838, 773148800711, 3326685824041, 14313982718072, 61589856118237, 265007332436969, 1140267093830134
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
According to Boyd (Acta Arithm. 32 (1977) p 89), quoting Pisot, every E(3,.) sequence satisfies a linear recurrence of at most order 3. Here this is easily derived from the first terms of the sequence. - R. J. Mathar, May 26 2008
A010920 coincides with this sequence for at least the first 32600 terms and probably more. - R. J. Mathar, May 26 2008
For n >= 1, a(n-1) is the number of generalized compositions of n when there are i+2 different types of i, (i=1,2,...). - Milan Janjic, Sep 24 2010
|
|
LINKS
|
|
|
FORMULA
|
a(n) = (2^(-1-n)*((5-sqrt(13))^n*(-11+3*sqrt(13)) + (5+sqrt(13))^n*(11+3*sqrt(13))))/sqrt(13). - Colin Barker, Nov 26 2016
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) Vec((3-2*x)/(1-5*x+3*x^2) + O(x^30)) \\ Colin Barker, Jul 27 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|