|
Search: id:A022092
|
|
|
| A022092 |
|
Fibonacci sequence beginning 0 9. |
|
+0
1
|
|
| 0, 9, 9, 18, 27, 45, 72, 117, 189, 306, 495, 801, 1296, 2097, 3393, 5490, 8883, 14373, 23256, 37629, 60885, 98514, 159399, 257913, 417312, 675225, 1092537, 1767762, 2860299, 4628061, 7488360, 12116421
(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) = round( (18phi-9)/5 phi^n) (works for n>4) - Thomas Baruchel, Sep 08 2004
a(n) = 9F(n) = F(n+4) + F(n+1) + F(n-2) + F(n-4), n>3.
G.f.: 9*x/(1-x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 20 2008]
|
|
MATHEMATICA
|
a={}; b=0; c=9; 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: A003886 A065999 A112440 this_sequence A053456 A144424 A147340
Adjacent sequences: A022089 A022090 A022091 this_sequence A022093 A022094 A022095
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
