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

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

%S 0,2,24,360,3360,31500,266112,2186184,17297280,133899480,1016158000,

%T 7596797208,56073378816,409544426200,2964295807200,21289879620000,

%U 151876184302080,1077036279535260,7597848475324800,53348055809155800,373012706986920000,2598270875886525840

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

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

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

%t a[n_] := n^2 * Binomial[2 n, n] * Fibonacci[n]; Array[a, 25, 0] (* _Amiram Eldar_, May 05 2023 *)

%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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)