The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A136507 a(n) = Sum_{k=0..n} binomial(2^(n-k) + k, n-k). 5

%I

%S 1,3,10,71,1925,203904,75214965,94608676477,409763735870986,

%T 6208539881584781823,334272186911271376874561,

%U 64832512634295914941490910360,45811927207957062190019240099653265

%N a(n) = Sum_{k=0..n} binomial(2^(n-k) + k, n-k).

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

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

%F a(n) ~ 2^(n^2) / n!. - _Vaclav Kotesovec_, Jul 02 2016

%F a(n_ = Sum_{k=0..n} A136555(n-k+1, k). - _G. C. Greubel_, Mar 14 2021

%p A136507:= n-> add(binomial(2^k +n-k, k), k=0..n); seq(A136507(n), n=0..20); # _G. C. Greubel_, Mar 14 2021

%t Table[Sum[Binomial[2^(n-k)+k,n-k],{k,0,n}],{n,0,20}] (* _Harvey P. Dale_, Mar 08 2015 *)

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

%o for(n=0,16, print1(a(n),", "))

%o (PARI) /* a(n) = coefficient of x^n in o.g.f. series: */

%o {a(n)=polcoeff(sum(i=0,n,1/(1-x-2^i*x^2 +x*O(x^n))*log(1+2^i*x +x*O(x^n))^i/i!),n)}

%o for(n=0,16, print1(a(n),", "))

%o (Sage) [sum(binomial(2^k +n-k, k) for k in (0..n)) for n in (0..20)] # _G. C. Greubel_, Mar 14 2021

%o (Magma) [(&+[Binomial(2^k +n-k, k): k in [0..n]]): n in [0..20]]; // _G. C. Greubel_, Mar 14 2021

%Y Cf. A014070 (C(2^n, n)), A136505 (C(2^n+1, n)), A136506 (C(2^n+2, n)).

%Y Cf. A136508, A136509, A136555.

%K nonn

%O 0,2

%A _Paul D. Hanna_, Jan 01 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 18 20:45 EDT 2021. Contains 345121 sequences. (Running on oeis4.)