|
Search: id:A094000
|
|
|
| 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. |
|
+0
3
|
|
| 1, 1, 3, 29, 1015, 126651, 53354350, 74698954306, 350688201987402, 5624061753186933530, 314512139441575825493524, 62498777166571927258267336860, 44831219113504221199415663547412096
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
G. Kilibarda and V. Jovovic, "Enumeration of some classes of T_0-hypergraphs", in preparation, 2004.
|
|
FORMULA
|
Main diagonal of A059202. a(n) = Sum(Stirling1(n+1, k)*binomial(2^(k-1)-1, n), k=0..n+1).
|
|
MATHEMATICA
|
f[n_] := Sum[ StirlingS1[n + 1, k] Binomial[2^(k - 1) - 1, n], {k, 0, n + 1}]; Table[ f[n], {n, 0, 12}] (from Robert G. Wilson v Jun 01 2004)
|
|
CROSSREFS
|
Cf. A059202, A048291, A088309.
Adjacent sequences: A093997 A093998 A093999 this_sequence A094001 A094002 A094003
Sequence in context: A117264 A065072 A088389 this_sequence A003190 A133663 A006526
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Goran Kilibarda, Vladeta Jovovic (vladeta(AT)Eunet.yu), May 30 2004
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 01 2004
|
|
|
Search completed in 0.002 seconds
|
