login
Number of 9-antichain covers of a labeled n-set.
4

%I #9 Jun 17 2013 03:32:48

%S 20,1484110,15936368770,59961701958816,121740972715475096,

%T 167109117756164222210,176340421320592288902670,

%U 154794453668193645059165412,118987888829384136293188343172

%N Number of 9-antichain covers of a labeled n-set.

%D 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)

%D V. Jovovic, G. Kilibarda, On enumeration of the class of all monotone Boolean functions, in preparation.

%H K. S. Brown, <a href="http://www.mathpages.com/home/kmath515.htm">Dedekind's problem</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Cover.html">Antichain covers</a>

%Y Cf. A056046-A056049, A056052, A051112-A051118.

%K nonn

%O 6,1

%A _Vladeta Jovovic_, Goran Kilibarda, Zoran Maksimovic, Jul 29 2000