|
| |
|
|
A022090
|
|
Fibonacci sequence beginning 0 7.
|
|
2
| |
|
|
0, 7, 7, 14, 21, 35, 56, 91, 147, 238, 385, 623, 1008, 1631, 2639, 4270, 6909, 11179, 18088, 29267, 47355, 76622, 123977, 200599, 324576, 525175, 849751, 1374926, 2224677, 3599603, 5824280, 9423883, 15248163, 24672046, 39920209, 64592255, 104512464
(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( (14phi-7)/5 phi^n) (works for n>3) - Thomas Baruchel, Sep 08 2004
a(n) = 7F(n) = F(n+4) + F(n-4), n>3.
a(n) = A119457(n+5,n-1) for n>1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 20 2006
G.f.: 7x/(1-x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 20 2008]
|
|
|
MATHEMATICA
| a={}; b=0; c=7; 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
| Cf. A000032.
Sequence in context: A003872 A168374 A112438 * A168379 A179886 A168411
Adjacent sequences: A022087 A022088 A022089 * A022091 A022092 A022093
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
