|
Search: id:A022088
|
|
|
| A022088 |
|
Fibonacci sequence beginning 0 5. |
|
+0
5
|
|
| 0, 5, 5, 10, 15, 25, 40, 65, 105, 170, 275, 445, 720, 1165, 1885, 3050, 4935, 7985, 12920, 20905, 33825, 54730, 88555, 143285, 231840, 375125, 606965, 982090, 1589055, 2571145, 4160200, 6731345, 10891545
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
A014217=1,1,2,4,6,11,17,29,. A014217(n+4) - A014217(n)=a(n+2). See today comment on A000204 and submitted A153263. [From Paul Curtz (bpcrtz(AT)free.fr), Dec 22 2008]
|
|
REFERENCES
|
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, p. 15 and id. 34,52.
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
a(n) = round( (2phi-1) phi^n ) (works for n>3) - Thomas Baruchel, Sep 08 2004
a(n) = 5F(n) = L(n-1) + L(n+1) = F(n+3) + F(n-1) + F(n-4), n>3.
a(n) = A119457(n+3,n-1) for n>1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 20 2006
G.f.: 5x/(1-x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 20 2008]
|
|
MAPLE
|
with (combinat):seq(add(fibonacci(n), k=1..5), n=0..32); - Zerinvary Lajos, Sep 21 2007
|
|
MATHEMATICA
|
a={}; b=0; c=5; AppendTo[a, b]; AppendTo[a, c]; Do[b=b+c; AppendTo[a, b]; c=b+c; AppendTo[a, c], {n, 1, 12, 1}]; a (Vladimir Orlovsky, Jul 23 2008)
|
|
CROSSREFS
|
Sequence in context: A109064 A138506 A000728 this_sequence A082450 A087705 A087033
Adjacent sequences: A022085 A022086 A022087 this_sequence A022089 A022090 A022091
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
