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

%I #23 May 05 2023 01:38:04

%S 0,2,48,2160,40320,787500,12773376,198942744,2905943040,40973240880,

%T 558886900000,7437264466632,96894798594048,1240510066959800,

%U 15645553270401600,194802398523000000,2398428702498447360,29240457953102773740,353391128284307097600

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

%F Sum_{n>=0} a(n)/16^n = (2 + sqrt(2743525 + 5578*sqrt(5)))/(100*sqrt(5)). - _Amiram Eldar_, May 05 2023

%p [seq(combinat:-fibonacci(n)^2*n^3*binomial(2*n, n), n=0..20)];

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

%o (PARI) a(n) = n^3*binomial(2*n, n)*fibonacci(n)^2; \\ _Michel Marcus_, Sep 07 2014

%Y Cf. A000045, A000984.

%K nonn,easy

%O 0,2

%A _Zerinvary Lajos_, Jun 09 2006

%E Title corrected by _Derek Orr_, Sep 07 2014

%E Maple program corrected by _Robert Israel_, Sep 07 2014

%E More terms from _Michel Marcus_, Sep 08 2014

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 14:32 EDT 2024. Contains 371960 sequences. (Running on oeis4.)