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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066384 a(n) = Sum_{k=0..n} C(2^n,k). 4
1, 3, 11, 93, 2517, 242825, 83278001, 100224990433, 423203101008289, 6320756952791172417, 337588530920463407788161, 65183827170777713040896325889, 45946801057461743411385200045344257, 119218150804947710897541255907308439677953, 1146646393160535279886911833912593527834996340737 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Harry J. Smith, Table of n, a(n) for n=0..50

FORMULA

G.f.: Sum_{n>=0} log(1+2^n*x)^n/((1-2^n*x)*n!). - Paul D. Hanna and Vladeta Jovovic, Jan 15 2008

a(n) ~ 2^(n^2) / n!. - Vaclav Kotesovec, Jul 02 2016

MATHEMATICA

Table[Sum[Binomial[2^n, k], {k, 0, n}], {n, 0, 15}] (* Vaclav Kotesovec, Jul 02 2016 *)

PROG

(PARI) { for (n=0, 50, a=0; for (k=0, n, a+=binomial(2^n, k)); write("b066384.txt", n, " ", a) ) } \\ Harry J. Smith, Feb 12 2010

CROSSREFS

Sequence in context: A231066 A091547 A063854 * A328810 A120587 A086914

Adjacent sequences:  A066381 A066382 A066383 * A066385 A066386 A066387

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Dec 23 2001

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 5 06:13 EDT 2020. Contains 333238 sequences. (Running on oeis4.)