|
Search: id:A096140
|
|
|
| A096140 |
|
a(n) = sum of n Fibonacci numbers starting from F(n). |
|
+0
1
|
|
| 1, 3, 10, 29, 81, 220, 589, 1563, 4126, 10857, 28513, 74792, 196041, 513619, 1345282, 3522981, 9224881, 24153636, 63239221, 165569195, 433476726, 1134874513, 2971168705, 7778667024, 20364889681, 53316094755, 139583544634
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
a(n) = Fibonacci(2*n+1)-Fibonacci(n+1). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Jul 17 2004
G.f.: (-1+x-x^2)/((1-3x+x^2)(-1+x+x^2)). a(n)=F(2n+1)-F(n+1). - Mario Catalani (mario.catalani(AT)unito.it), Jul 19 2004
|
|
EXAMPLE
|
a(4)= F(4) + F(5) + F(6) + F(7) = 3 + 5 + 8 + 13 = 29.
|
|
PROGRAM
|
(PARI) a(n)=sum(k=n, 2*n-1, fibonacci(k))
|
|
CROSSREFS
|
Adjacent sequences: A096137 A096138 A096139 this_sequence A096141 A096142 A096143
Sequence in context: A130218 A114958 A048493 this_sequence A052976 A006484 A026960
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 16 2004
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 17 2004
|
|
|
Search completed in 0.002 seconds
|
