The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A119703 a(n) = n^3*binomial(2*n, n)*Fibonacci(n). 1

%I #19 May 05 2023 01:38:51

%S 0,2,48,1080,13440,157500,1596672,15303288,138378240,1205095320,

%T 10161580000,83564769288,672880545792,5324077540600,41500141300800,

%U 319348194300000,2430018948833280,18309616752099420,136761272555846400,1013613060373960200,7460254139738400000

%N a(n) = n^3*binomial(2*n, n)*Fibonacci(n).

%H Robert Israel, <a href="/A119703/b119703.txt">Table of n, a(n) for n = 0..978</a>

%F Sum_{n>=0} a(n)/8^n = 479*sqrt(10)/8. - _Amiram Eldar_, May 05 2023

%p [seq((n^3*binomial(2*n, n))*combinat:-fibonacci(n), n=0..25)]; # corrected by _Robert Israel_, Sep 07 2014

%t Table[n^3 Binomial[2n,n]Fibonacci[n],{n,0,30}] (* _Harvey P. Dale_, Jan 14 2017 *)

%o (PARI) vector(50,n,(n-1)^3*(binomial(2*(n-1),n-1))*fibonacci(n-1)) \\ _Derek Orr_, Sep 07 2014

%Y Cf. A000984, A000045.

%K nonn,easy

%O 0,2

%A _Zerinvary Lajos_, Jun 09 2006

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 May 14 17:50 EDT 2024. Contains 372533 sequences. (Running on oeis4.)