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!)
A141478 a(n) = binomial(n+2,3)*4^3. 2

%I #31 Mar 17 2023 07:28:34

%S 64,256,640,1280,2240,3584,5376,7680,10560,14080,18304,23296,29120,

%T 35840,43520,52224,62016,72960,85120,98560,113344,129536,147200,

%U 166400,187200,209664,233856,259840,287680,317440,349184,382976,418880,456960,497280,539904,584896

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

%H Vincenzo Librandi, <a href="/A141478/b141478.txt">Table of n, a(n) for n = 1..1000</a>

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).

%F G.f.: 64*x/(1-x)^4.

%F a(n) = 32*n*(n+1)*(n+2)/3 = 64*A000292(n).

%F a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4). - _Vincenzo Librandi_, Jun 29 2012

%F From _Amiram Eldar_, Aug 29 2022: (Start)

%F Sum_{n>=1} 1/a(n) = 3/128.

%F Sum_{n>=1} (-1)^(n+1)/a(n) = 3*log(2)/16 - 15/128. (End)

%p seq(binomial(n+2,3)*4^3, n=1..36);

%t CoefficientList[Series[64/(1-x)^4,{x,0,40}],x] (* _Vincenzo Librandi_, Jun 29 2012 *)

%o (Magma) [Binomial(n+2,3)*4^3: n in [1..34]]; // _Bruno Berselli_, Apr 07 2011

%o (Magma) I:=[64, 256, 640, 1280]; [n le 4 select I[n] else 4*Self(n-1)-6*Self(n-2)+4*Self(n-3)-Self(n-4): n in [1..50]]; // _Vincenzo Librandi_, Jun 29 2012

%Y Cf. A000292, A035008, A038231 (3rd subdiagonal).

%K nonn,easy

%O 1,1

%A _Zerinvary Lajos_, Aug 09 2008

%E Offset adapted to the g.f. by _Bruno Berselli_, Apr 07 2011

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 25 10:42 EDT 2024. Contains 371967 sequences. (Running on oeis4.)