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!)
A134173 a(n) = Sum_{k=0..n} binomial(n,k)*binomial(2^k,n). 3
1, 3, 8, 68, 2106, 223776, 80532200, 98945392200, 421225839051260, 6310402120912239968, 337401124757628967733136, 65171905481441631827737564000, 45944096973025484590366745753166436 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
G.f.: Sum_{n>=0} log(1+(2^n+1)*x)^n/n!.
From Vaclav Kotesovec, Jul 02 2016: (Start)
a(n) ~ binomial(2^n,n).
a(n) ~ 2^(n^2) / n!.
a(n) ~ 2^(n^2 - 1/2) * exp(n) / (sqrt(Pi) * n^(n+1/2)).
(End)
MAPLE
a:=proc(n) options operator, arrow: sum(binomial(n, k)*binomial(2^k, n), k=0..n) end proc: seq(a(n), n=0..13); # Emeric Deutsch, Jan 27 2008
MATHEMATICA
Table[Sum[Binomial[n, k]*Binomial[2^k, n], {k, 0, n}], {n, 0, 15}] (* Vaclav Kotesovec, Jul 02 2016 *)
PROG
(PARI) for(n=0, 25, print1(sum(k=0, n, binomial(n, k)*binomial(2^k, n)), ", ")) \\ G. C. Greubel, Mar 21 2017
CROSSREFS
Sequence in context: A224230 A053740 A363312 * A095051 A362990 A092372
KEYWORD
easy,nonn
AUTHOR
EXTENSIONS
More terms from Emeric Deutsch, Jan 27 2008
STATUS
approved

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 June 29 16:44 EDT 2024. Contains 373852 sequences. (Running on oeis4.)