|
| |
|
|
A022091
|
|
Fibonacci sequence beginning 0 8.
|
|
4
| |
|
|
0, 8, 8, 16, 24, 40, 64, 104, 168, 272, 440, 712, 1152, 1864, 3016, 4880, 7896, 12776, 20672, 33448, 54120, 87568, 141688, 229256, 370944, 600200, 971144, 1571344, 2542488, 4113832, 6656320, 10770152, 17426472, 28196624, 45623096, 73819720, 119442816
(list; graph; refs; listen; history; 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
| Tanya Khovanova, Recursive Sequences
|
|
|
FORMULA
| a(n) = round( (16phi-8)/5 phi^n) (works for n>4) - Thomas Baruchel, Sep 08 2004
a(n) = 8F(n) = F(n+4) + F(n) + F(n-4), n>3.
G.f.: 8*x/(1-x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 20 2008]
|
|
|
MATHEMATICA
| a={}; b=0; c=8; 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
| Cf. A000032.
Sequence in context: A168397 A186986 A112439 * A171188 A145909 A168409
Adjacent sequences: A022088 A022089 A022090 * A022092 A022093 A022094
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
