|
Search: id:A022093
|
|
|
| A022093 |
|
Fibonacci sequence beginning 0 10. |
|
+0
1
|
|
| 0, 10, 10, 20, 30, 50, 80, 130, 210, 340, 550, 890, 1440, 2330, 3770, 6100, 9870, 15970, 25840, 41810, 67650, 109460, 177110, 286570, 463680, 750250, 1213930, 1964180, 3178110, 5142290, 8320400
(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( (4phi-2) phi^n) (works for n>4) - Thomas Baruchel, Sep 08 2004
a(n) = 10F(n) = F(n+4) + F(n+2) + F(n-2) + F(n-4), n>3.
|
|
CROSSREFS
|
Adjacent sequences: A022090 A022091 A022092 this_sequence A022094 A022095 A022096
Sequence in context: A047879 A097041 A040091 this_sequence A076817 A109051 A003875
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
