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!)
A177411 a(n) = binomial((n+1)*2^(n+1), n)/(n+1). 2

%I #8 Feb 03 2019 10:39:58

%S 1,4,92,10416,5258872,11297164096,100955979001152,3709635244861142784,

%T 556796318904269731012544,339945532169833436692992549888,

%U 841788571395046141591475043524725760

%N a(n) = binomial((n+1)*2^(n+1), n)/(n+1).

%F a(n) = [x^n] (1 + x)^((n+1)*2^(n+1))/(n+1).

%F a(n) = [x^n] Sum_{k=0..n} 2^k*(n+1)^(k-1) * log(1 + 2^k*x)^k/k!. - _Paul D. Hanna_, Jul 03 2010

%t Table[Binomial[(n+1)2^(n+1),n]/(n+1),{n,0,20}] (* _Harvey P. Dale_, Feb 03 2019 *)

%o (PARI) {a(n)=binomial((n+1)*2^(n+1),n)/(n+1)}

%o (PARI) {a(n)=polcoeff(sum(k=0, n, 2^k*(n+1)^(k-1)*log(1+2^k*x +x*O(x^n))^k/k!), n)} \\ _Paul D. Hanna_, Jul 03 2010

%Y Cf. A177410, A177400.

%K nonn

%O 0,2

%A _Paul D. Hanna_, Jun 26 2010

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 August 16 15:08 EDT 2024. Contains 375177 sequences. (Running on oeis4.)