login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A037843 Number of matrices with n columns whose rows do not cover each other; ordered antichains of subsets of an n-set. 1
2, 3, 7, 39, 2551, 22928343, 6641112790058484007 (list; graph; refs; listen; history; text; internal format)
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
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
Sequence in context: A047024 A182219 A227777 * A355129 A102604 A119662
KEYWORD
hard,nonn
AUTHOR
Vladeta Jovovic, Goran Kilibarda, Jul 23 2000
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 3 07:18 EDT 2024. Contains 373966 sequences. (Running on oeis4.)