|
| |
|
|
A022093
|
|
Fibonacci sequence beginning 0 10.
|
|
0
| |
|
|
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; 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( (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.
G.f.: 10*x/(1-x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 20 2008]
|
|
|
MATHEMATICA
| a={}; b=0; c=10; AppendTo[a, b]; AppendTo[a, c]; Do[b=b+c; AppendTo[a, b]; c=b+c; AppendTo[a, c], {n, 4!}]; a [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 17 2008]
|
|
|
CROSSREFS
| Sequence in context: A205724 A040091 A168461 * A076817 A200984 A185993
Adjacent sequences: A022090 A022091 A022092 * A022094 A022095 A022096
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
