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!)
A136649 Binomial transform of A014070: a(n) = Sum_{k=0..n} C(n,k)*C(2^k,k). 1

%I #17 Jun 26 2022 09:17:18

%S 1,3,11,81,2089,211107,76211147,95054910473,410422012327681,

%T 6211807332775516467,334327967114349983723899,

%U 64835852334793138873642165105,45812640033676518721399820389451657

%N Binomial transform of A014070: a(n) = Sum_{k=0..n} C(n,k)*C(2^k,k).

%H G. C. Greubel, <a href="/A136649/b136649.txt">Table of n, a(n) for n = 0..59</a>

%F G.f.: A(x) = (1/(1-x))*Sum_{n>=0} [log(1 + (2^n-1)*x) - log(1-x)]^n / n!.

%F From _Vaclav Kotesovec_, Jul 02 2016: (Start)

%F a(n) ~ binomial(2^n,n).

%F a(n) ~ 2^(n^2) / n!.

%F a(n) ~ 2^(n^2 - 1/2) * exp(n) / (sqrt(Pi) * n^(n+1/2)). (End)

%t Table[Sum[Binomial[n,k]*Binomial[2^k,k],{k,0,n}],{n,0,15}] (* _Vaclav Kotesovec_, Jul 02 2016 *)

%o (PARI) {a(n)=sum(k=0,n,binomial(n,k)*binomial(2^k,k))}

%o (PARI) /* Using the g.f.: */ {a(n)=local(X=x+x*O(x^n));polcoeff(sum(k=0,n,(log(1+(2^k-1)*X)-log(1-X))^k/k!)/(1-X),n)}

%Y Cf. A014070 (C(2^n, n)), A134173.

%Y Partial sums of A180687.

%K nonn

%O 0,2

%A _Paul D. Hanna_ and _Vladeta Jovovic_, Jan 21 2008

%E Edited by _Charles R Greathouse IV_, Oct 28 2009

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