|
|
A022346
|
|
Fibonacci sequence beginning 0, 12.
|
|
3
|
|
|
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, 16155228, 26139708, 42294936, 68434644, 110729580, 179164224, 289893804, 469058028, 758951832, 1228009860
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
FORMULA
|
a(n) = 12*F(n) = F(n+5) + F(n-1) + F(n-3) + F(n-6) for n > 5, where F=A000045.
|
|
MATHEMATICA
|
LinearRecurrence[{1, 1}, {0, 12}, 40] (* Harvey P. Dale, May 07 2016 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|