|
Search: id:A022086
|
|
|
| A022086 |
|
Fibonacci sequence beginning 0 3. |
|
+0
10
|
|
| 0, 3, 3, 6, 9, 15, 24, 39, 63, 102, 165, 267, 432, 699, 1131, 1830, 2961, 4791, 7752, 12543, 20295, 32838, 53133, 85971, 139104, 225075, 364179, 589254, 953433, 1542687, 2496120, 4038807, 6534927, 10573734
(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, id. 7,17.
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
a(n) = round( (6phi-3)/5 phi^n ) (works for n>2) - Thomas Baruchel, Sep 08 2004
3*F(n). For n>1, F(n-2) + F(n+2), with F(n) = A000045(n).
a(n) = A119457(n+1,n-1) for n>1. - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), May 20 2006
First differences of A111314. - Ross La Haye (rlahaye(AT)new.rr.com), May 31 2006
|
|
MAPLE
|
BB := n->if n=0 then 3; > elif n=1 then 0; > else BB(n-2)+BB(n-1); > fi: > L:=[]: for k from 1 to 34 do L:=[op(L), BB(k)]: od: L; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 19 2007
with (combinat):seq(sum((fibonacci(n, 1)), m=1..3), n=0..32); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 19 2008
|
|
CROSSREFS
|
Essentially the same as A097135. Cf. A026390, A036999.
Sequence in context: A058628 A035528 A050337 this_sequence A097135 A124326 A031504
Adjacent sequences: A022083 A022084 A022085 this_sequence A022087 A022088 A022089
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
