login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056101 Number of 8-antichain covers of a labeled n-set. 3
115, 1612560, 4681922770, 5933930926484, 4603693881222819, 2608258836131076210 (list; graph; refs; listen; history; text; internal format)
OFFSET

5,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

Table of n, a(n) for n=5..10.

K. S. Brown, Dedekind's problem

Eric Weisstein's World of Mathematics, Antichain covers

CROSSREFS

Cf. A056046-A056049, A056052, A051116.

Sequence in context: A251215 A218324 A005466 * A051116 A095623 A105934

Adjacent sequences:  A056098 A056099 A056100 * A056102 A056103 A056104

KEYWORD

nonn

AUTHOR

Vladeta Jovovic, Goran Kilibarda, Zoran Maksimovic, Jul 28 2000

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified December 29 05:59 EST 2014. Contains 252719 sequences.