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!)
A323223 a(n) = [x^n] x/((1 - x)*(1 - 4*x)^(5/2)). 2

%I #17 Jan 29 2019 09:10:42

%S 0,1,11,81,501,2811,14823,74883,366603,1752273,8218733,37964449,

%T 173172249,781607349,3496163949,15517771749,68412846069,299828796219,

%U 1307168814519,5672308893819,24511334499219,105519144602439,452695473616239,1936085243038839,8256615564926439

%N a(n) = [x^n] x/((1 - x)*(1 - 4*x)^(5/2)).

%H Seiichi Manyama, <a href="/A323223/b323223.txt">Table of n, a(n) for n = 0..1653</a>

%F a(n) = ((5*n + 1)*a(n-1) - (4*n + 2)*a(n-2))/(n - 1) for n >= 2.

%F a(n) = -(-4)^n*binomial(-5/2, n)*hypergeom([1, n+5/2], [n+1], 4) - i*sqrt(3)/27.

%F a(n) ~ 2^(2*n+2) * n^(3/2) / (9*sqrt(Pi)). - _Vaclav Kotesovec_, Jan 29 2019

%F a(n+1) - a(n) = A002802(n). - _Seiichi Manyama_, Jan 29 2019

%p A323223List := proc(len) local ogf, ser; ogf := (1 - 4*x)^(-5/2)*x/(1 - x);

%p ser := series(ogf, x, (n+1)*len+1); seq(coeff(ser, x, j), j=0..len) end:

%p A323223List(24);

%p # Alternative:

%p a := proc(n) option remember; `if`(n<2,n,((5*n+1)*a(n-1)-(4*n+2)*a(n-2))/(n-1)) end: seq(a(n), n=0..24);

%Y Row 5 of A323222.

%Y Cf. A002802.

%K nonn

%O 0,3

%A _Peter Luschny_, Jan 26 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 July 25 01:41 EDT 2024. Contains 374585 sequences. (Running on oeis4.)