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!)
A119699 a(n) = n^2*binomial(2*n, n)*Fibonacci(n)^2. 0

%I #10 May 05 2023 01:38:14

%S 0,2,24,720,10080,157500,2128896,28420392,363242880,4552582320,

%T 55888690000,676114951512,8074566549504,95423851304600,

%U 1117539519314400,12986826568200000,149901793906152960,1720026938417810220,19632840460239283200,223048221338080399800

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

%F Sum_{n>=0} a(n)/16^n = (14 + 5*sqrt(19165 + 178*sqrt(5)))/(250*sqrt(5)). - _Amiram Eldar_, May 05 2023

%p [seq(fib(n)^2*n^2*binomial(2*n, n), n=0..25)];

%t Table[n^2 Binomial[2n,n]Fibonacci[n]^2,{n,0,20}] (* _Harvey P. Dale_, Jul 21 2019 *)

%Y Cf. A000045, A000984.

%K nonn,easy

%O 0,2

%A _Zerinvary Lajos_, Jun 09 2006

%E Definition corrected by _Harvey P. Dale_, Jul 21 2019

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 15:57 EDT 2024. Contains 371961 sequences. (Running on oeis4.)