|
Search: id:A022346
|
|
|
| A022346 |
|
Fibonacci sequence beginning 0 12. |
|
+0
1
|
|
| 0, 12, 12, 24, 36, 60, 96, 156, 252, 408, 660, 1068, 1728, 2796, 4524, 7320, 11844, 19164, 31008, 50172, 81180, 131352, 212532, 343884, 556416, 900300, 1456716, 2357016, 3813732, 6170748, 9984480
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, p. 15.
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
a(n) = 12F(n) = F(n+5) + F(n-1) + F(n-3) + F(n-6), n>5.
G.f.: 12*x/(1-x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 20 2008]
|
|
MATHEMATICA
|
a={}; b=0; c=12; AppendTo[a, b]; AppendTo[a, c]; Do[b=b+c; AppendTo[a, b]; c=b+c; AppendTo[a, c], {n, 4!}]; a [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 17 2008]
|
|
CROSSREFS
|
Sequence in context: A064161 A040133 A092538 this_sequence A070710 A048759 A119877
Adjacent sequences: A022343 A022344 A022345 this_sequence A022347 A022348 A022349
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
