|
Search: id:A037843
|
|
|
| A037843 |
|
Number of matrices with n columns whose rows do not cover each other; ordered antichains of subsets of an n-set. |
|
+0
2
|
| |
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
V. Jovovic and G. Kilibarda, On the number of Boolean functions in the Post classes F^{mu}_8, Diskretnaya Matematika, 11 (1999), no. 4, 127-138 (translated in Discrete Mathematics and Applications, 9, (1999), no. 6)
V. Jovovic, G. Kilibarda, On enumeration of the class of all monotone Boolean functions, in preparation.
|
|
LINKS
|
K. S. Brown, Dedekind's problem
Index entries for sequences related to Boolean functions
|
|
FORMULA
|
a(n)=Sum_{k=0..C(n, floor(n/2))}k!*M(n, k) where M(n, k) is the number of distinct monotone Boolean functions of n variables with k mincuts.
|
|
CROSSREFS
|
Cf. A003182, A051112-A051117, A007411, A006602.
Sequence in context: A000317 A047024 A171708 this_sequence A102604 A119662 A163157
Adjacent sequences: A037840 A037841 A037842 this_sequence A037844 A037845 A037846
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Vladeta Jovovic, Goran Kilibarda (vladeta(AT)eunet.rs), Jul 23 2000
|
|
|
Search completed in 0.002 seconds
|
