|
Search: id:A022130
|
|
|
| A022130 |
|
Fibonacci sequence beginning 4 9. |
|
+0
2
|
|
| 4, 9, 13, 22, 35, 57, 92, 149, 241, 390, 631, 1021, 1652, 2673, 4325, 6998, 11323, 18321, 29644, 47965, 77609, 125574, 203183, 328757, 531940, 860697, 1392637, 2253334, 3645971, 5899305, 9545276
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
H. Zhao and X. Li, On the Fibonacci numbers of trees, Fib. Quart., 44 (2006), 32-38.
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
a(n) = 4*F(n)+F(n-2).
G.f.: (4+5x)/(1-x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 19 2008]
|
|
MATHEMATICA
|
a={}; b=4; c=9; AppendTo[a, b]; AppendTo[a, c]; Do[b=b+c; AppendTo[a, b]; c=b+c; AppendTo[a, c], {n, 1, 40, 1}]; a (Vladimir Orlovsky, Jul 23 2008)
|
|
CROSSREFS
|
Sequence in context: A035104 A141224 A064423 this_sequence A042125 A041905 A098004
Adjacent sequences: A022127 A022128 A022129 this_sequence A022131 A022132 A022133
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
