login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096140 a(n) = sum of n Fibonacci numbers starting from F(n). 3
0, 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; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..27.

FORMULA

a(n) = Fibonacci(2*n+1)-Fibonacci(n+1). - Vladeta Jovovic, Jul 17 2004

G.f.: x*(1-x+x^2)/((1-3*x+x^2)*(1-x-x^2)). a(n)=F(2n+1)-F(n+1). - Mario Catalani (mario.catalani(AT)unito.it), Jul 19 2004

Binomial transform of A005013. - Michael Somos, Apr 13 2012

EXAMPLE

a(4)= F(4) + F(5) + F(6) + F(7) = 3 + 5 + 8 + 13 = 29.

x + 3*x^2 + 10*x^3 + 29*x^4 + 81*x^5 + 220*x^6 + 589*x^7 + ...

PROG

(PARI) a(n)=sum(k=n, 2*n-1, fibonacci(k))

(Maxima) makelist(fib(2*n+3)-fib(n+2), n, 0, 20); [Emanuele Munarini, Mar 29 2012]

CROSSREFS

Cf. A005013.

Sequence in context: A114958 A048493 A269144 * A307262 A291393 A244615

Adjacent sequences:  A096137 A096138 A096139 * A096141 A096142 A096143

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Jul 16 2004

EXTENSIONS

Extended by Ray Chandler, Jul 17 2004

a(0)=0 by Michael Somos, Apr 13 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 4 16:24 EDT 2020. Contains 335448 sequences. (Running on oeis4.)