|
Search: id:A015553
|
|
|
| A015553 |
|
Linear 2nd order recurrence. |
|
+0
9
|
|
| 0, 1, 6, 47, 348, 2605, 19458, 145403, 1086456, 8118169, 60660030, 453260039, 3386820564, 25306783813, 189095729082, 1412948996435, 10557746998512, 78888920951857, 589468742694774, 4404590586639071, 32911699689476940
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Let the generator matrix for the binary Golay G_24 code be [I|B]. Then a(n)=(A^n)_1,2 for instance. Third binomial transform of (0,1,0,20,0,400,0,8000,....). - Paul Barry (pbarry(AT)wit..ie), Feb 13 2004
|
|
FORMULA
|
a(n) = 6 a(n-1) + 11 a(n-2).
a(n)=(1/4)*sum(k=0, n, binomial(n, k)*Fibonacci(k)*4^k) - Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 25 2003
a(n)=sqrt(5)(3+2sqrt(5))^n/20-sqrt(5)(3-2sqrt(5))^n/20 - Paul Barry (pbarry(AT)wit..ie), Feb 13 2004
G.f.: -x/(-1+6*x+11*x^2). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 16 2007
|
|
CROSSREFS
|
Cf. A015551.
Sequence in context: A015865 A027012 A024076 this_sequence A071878 A104256 A000252
Adjacent sequences: A015550 A015551 A015552 this_sequence A015554 A015555 A015556
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Olivier Gerard (ogerard(AT)ext.jussieu.fr)
|
|
|
Search completed in 0.002 seconds
|
