This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A014070 a(n) = C(2^n,n). 37
 1, 2, 6, 56, 1820, 201376, 74974368, 94525795200, 409663695276000, 6208116950265950720, 334265867498622145619456, 64832175068736596027448301568, 45811862025512780638750907861652480 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n) is the number of n X n (0,1) matrices with distinct rows modulo rows permutations . - Yuval Dekel (dekelyuval(AT)hotmail.com), Nov 13 2003 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..60 FORMULA G.f.: A(x) = Sum_{n>=0} log(1 + 2^n*x)^n / n!. - Paul D. Hanna, Dec 28 2007 From Vaclav Kotesovec, Jul 02 2016: (Start) a(n) ~ 2^(n^2) / n!. a(n) ~ 2^(n^2 - 1/2) * exp(n) / (sqrt(Pi) * n^(n+1/2)). (End) MATHEMATICA Table[Binomial[2^n, n], {n, 0, 20}] (* Vladimir Joseph Stephan Orlovsky, Mar 03 2011*) PROG (PARI) a(n)=binomial(2^n, n) (PARI) /* G.f. A(x) as Sum of Series: */ a(n)=polcoeff(sum(k=0, n, log(1+2^k*x +x*O(x^n))^k/k!), n) \\ Paul D. Hanna, Dec 28 2007 (MAGMA) [Binomial(2^n, n): n in [0..25]]; // Vincenzo Librandi, Sep 13 2016 CROSSREFS Cf. A088229, A136393. Sequence in context: A000146 A211933 A167010 * A198445 A248377 A209497 Adjacent sequences:  A014067 A014068 A014069 * A014071 A014072 A014073 KEYWORD nonn,easy AUTHOR 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 23 20:09 EDT 2017. Contains 293812 sequences.