|
Search: id:A058038
|
|
|
| A058038 |
|
Fibonacci(2*n)*Fibonacci(2*n+2). |
|
+0
3
|
|
| 0, 3, 24, 168, 1155, 7920, 54288, 372099, 2550408, 17480760, 119814915, 821223648, 5628750624, 38580030723, 264431464440, 1812440220360, 12422650078083, 85146110326224, 583600122205488, 4000054745112195, 27416783093579880, 187917426909946968
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Partial sums of A033888, i.e. a(n) = Sum_{k=0..n} Fibonacci(4*k). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 09 2002
|
|
REFERENCES
|
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, id. 29.
|
|
FORMULA
|
a(n) = -3/5+(1/5*sqrt(5)+3/5)*(2*1/(7+3*sqrt(5)))^n/(7+3*sqrt(5))+(1/5*sqrt(5)-3/5)*(-2*1/(-7+3*sqrt(5)))^n/(-7+3*sqrt(5)). Recurrence: a(n) = 8*a(n-1)-8*a(n-2)+a(n-3). G.f.: 3*x/(1-7*x+x^2)/(1-x). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 09 2002
|
|
CROSSREFS
|
Cf. A033888, A004187.
Equals A081068 + 1. Bisection of A059929, A064831 and A080097.
Sequence in context: A067370 A094432 A104527 this_sequence A089697 A120741 A073985
Adjacent sequences: A058035 A058036 A058037 this_sequence A058039 A058040 A058041
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Jun 09 2002
|
|
|
Search completed in 0.002 seconds
|
