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!)
 A094000 Number of n X n (0,1)-matrices with no zero rows or columns and with all rows distinct and all columns distinct, up to permutation of rows. 16
 1, 1, 3, 29, 1015, 126651, 53354350, 74698954306, 350688201987402, 5624061753186933530, 314512139441575825493524, 62498777166571927258267336860, 44831219113504221199415663547412096 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Main diagonal of A059202. REFERENCES G. Kilibarda and V. Jovovic, "Enumeration of some classes of T_0-hypergraphs", in preparation, 2004. LINKS G. C. Greubel, Table of n, a(n) for n = 0..59 FORMULA a(n) = Sum(Stirling1(n+1, k)*binomial(2^(k-1)-1, n), k=0..n+1). a(n) ~ binomial(2^n,n). - Vaclav Kotesovec, Mar 18 2014 MATHEMATICA f[n_] := Sum[ StirlingS1[n + 1, k] Binomial[2^(k - 1) - 1, n], {k, 0, n + 1}]; Table[ f[n], {n, 0, 12}] (* Robert G. Wilson v, Jun 01 2004 *) CROSSREFS Cf. A048291, A059202, A088309. Binary matrices with distinct rows and columns, various versions: A059202, A088309, A088310, A088616, A089673, A089674, A093466, A094000, A094223, A116532, A116539, A181230, A259763 Sequence in context: A065072 A088389 A270883 * A162085 A182385 A255597 Adjacent sequences:  A093997 A093998 A093999 * A094001 A094002 A094003 KEYWORD nonn,easy AUTHOR Goran Kilibarda, Vladeta Jovovic, May 30 2004 EXTENSIONS More terms from Robert G. Wilson v, Jun 01 2004 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.

Last modified September 24 12:31 EDT 2021. Contains 347642 sequences. (Running on oeis4.)