login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096140 a(n) = sum of n Fibonacci numbers starting from F(n). 4

%I #19 Apr 30 2014 01:34:23

%S 0,1,3,10,29,81,220,589,1563,4126,10857,28513,74792,196041,513619,

%T 1345282,3522981,9224881,24153636,63239221,165569195,433476726,

%U 1134874513,2971168705,7778667024,20364889681,53316094755,139583544634

%N a(n) = sum of n Fibonacci numbers starting from F(n).

%F a(n) = Fibonacci(2*n+1)-Fibonacci(n+1). - _Vladeta Jovovic_, Jul 17 2004

%F 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

%F Binomial transform of A005013. - _Michael Somos_, Apr 13 2012

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

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

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

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

%Y Cf. A005013.

%K nonn

%O 0,3

%A _Amarnath Murthy_, Jul 16 2004

%E Extended by _Ray Chandler_, Jul 17 2004

%E a(0)=0 by _Michael Somos_, Apr 13 2012

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 12:22 EDT 2024. Contains 371937 sequences. (Running on oeis4.)