%I A014070
%S A014070 1,2,6,56,1820,201376,74974368,94525795200,409663695276000,
%T A014070 6208116950265950720,334265867498622145619456,
%U A014070 64832175068736596027448301568,45811862025512780638750907861652480
%N A014070 C(2^n,n).
%C A014070 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
%F A014070 G.f.: A(x) = Sum_{n>=0} log(1 + 2^n*x)^n / n!. - Paul D. Hanna (pauldhanna(AT)juno.com), 
               Dec 28 2007
%o A014070 (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 (pauldhanna(AT)juno.com), Dec 28 2007
%Y A014070 Cf. A088229.
%Y A014070 Sequence in context: A084123 A074023 A000146 this_sequence A132525 A074167 
               A083787
%Y A014070 Adjacent sequences: A014067 A014068 A014069 this_sequence A014071 A014072 
               A014073
%K A014070 nonn,easy
%O A014070 0,2
%A A014070 N. J. A. Sloane (njas(AT)research.att.com).