|
Search: id:A001060
|
|
|
| A001060 |
|
a(n) = a(n-1) + a(n-2).
(Formerly M1338 N0512)
|
|
+0
5
|
|
| 2, 5, 7, 12, 19, 31, 50, 81, 131, 212, 343, 555, 898, 1453, 2351, 3804, 6155, 9959, 16114, 26073, 42187, 68260, 110447, 178707, 289154, 467861, 757015, 1224876, 1981891, 3206767, 5188658, 8395425, 13584083, 21979508, 35563591, 57543099
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
A. Brousseau, Seeking the lost gold mine or exploring Fibonacci factorizations, Fib. Quart., 3 (1965), 129-130.
A. Brousseau, Fibonacci and Related Number Theoretic Tables. Fibonacci Association, San Jose, CA, 1972, p. 52.
|
|
LINKS
|
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
a(n)=2*fibonacci(n-3)+fibonacci(n), n>=3. - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 05 2007
|
|
MAPLE
|
with(combinat):a:=n->2*fibonacci(n-3)+fibonacci(n): seq(a(n), n=3..38); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 05 2007
A001060:=-(2+3*z)/(-1+z+z**2); [Conjectured by S. Plouffe in his 1992 dissertation.]
|
|
CROSSREFS
|
Apart from initial term, same as A013655.
Sequence in context: A005895 A135525 A117538 this_sequence A042343 A042691 A112732
Adjacent sequences: A001057 A001058 A001059 this_sequence A001061 A001062 A001063
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 04 2000
|
|
|
Search completed in 0.002 seconds
|
