|
Search: id:A101879
|
|
|
| A101879 |
|
a(0) = 1, a(1) = 1, a(2) = 2, for n>2 a(n) = 5*a(n-1) - 5*a(n-2) + a(n-3). |
|
+0
1
|
|
| 1, 1, 2, 6, 21, 77, 286, 1066, 3977, 14841, 55386, 206702, 771421, 2878981, 10744502, 40099026, 149651601, 558507377, 2084377906, 7779004246, 29031639077, 108347552061, 404358569166, 1509086724602, 5631988329241, 21018866592361
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Consider the matrix M=[1,1,0; 1,3,1; 0,1,1]; Characteristic polynomial of M is x^3 - 5*x^2 + 5*x - 1. Use (M^n)[1,1] to define the recursion a(0) = 1, a(1) = 1, a(2) = 2, for n>2 a(n) = 5*a(n-1) - 5*a(n-2) + a(n-3).
a(n+1)/a(n) converges to 2 + sqrt(3) as n goes to infinity, the largest root of the characteristic polynomial. a(n) = A061278(n) + 1; (M^n)[1,2] = A001353(n); (M^n)[1,3] = A061278(n-1) for n>0; all with the same recursive properties.
|
|
PROGRAM
|
(PARI) M=[1, 1, 0; 1, 3, 1; 0, 1, 1]; for(i=0, 40, print1((M^i)[1, 1], ", "))
|
|
CROSSREFS
|
Cf. A061278, A001353, A061278.
Adjacent sequences: A101876 A101877 A101878 this_sequence A101880 A101881 A101882
Sequence in context: A116772 A131792 A101265 this_sequence A101907 A063023 A124292
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Lambert Klasen (lambert.klasen(AT)gmx.net) and Gary W. Adamson (qntmpkt(AT)yahoo.com), Jan 28 2005
|
|
|
Search completed in 0.002 seconds
|
