|
Search: id:A022090
|
|
|
| A022090 |
|
Fibonacci sequence beginning 0 7. |
|
+0
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
(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( (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)lhsystems.com), May 20 2006
|
|
CROSSREFS
|
Sequence in context: A040043 A003872 A112438 this_sequence A120682 A100635 A139126
Adjacent sequences: A022087 A022088 A022089 this_sequence A022091 A022092 A022093
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
