|
Search: id:A059083
|
|
|
| A059083 |
|
Number of T_0-antichains on a labeled n-set. |
|
+0 7
|
|
| 2, 3, 3, 8, 96, 6373, 7725703, 2414518872815, 56130437161078967568912
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
An antichain on a set is a T_0-antichain if for every two distinct points of the set there exists a member of the antichain containing one but not the other point.
|
|
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
|
V. Jovovic, 3-element T_0-antichains on a labeled 4-set
V. Jovovic, Formula for the number of m-element T_0-antichains on a labeled n-set
|
|
FORMULA
|
a(n)=Sum_{m=0..binomial(n, floor(n/2))} A(m, n), where A(m, n) is number of m-element T_0-antichains on a labeled n-set. Cf. A059080.
|
|
EXAMPLE
|
a(0) = 1 + 1, a(1) = 1 + 2, a(2) = 2 + 1, a(3) = 6 + 2, a(4) = 12 + 52 + 25 + 6 + 1, a(5) = 520 + 1770 + 2086 + 1370 + 490 + 115 + 20 + 2. a(n) = column sums of A059080.
|
|
CROSSREFS
|
Cf. A059079-A059082, A059048-A059052.
Cf. A000372.
Sequence in context: A011155 A108381 A108692 this_sequence A124931 A124932 A110042
Adjacent sequences: A059080 A059081 A059082 this_sequence A059084 A059085 A059086
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Vladeta Jovovic, Goran Kilibarda (vladeta(AT)Eunet.yu), Jan 06 2001
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Nov 28 2003
|
|
|
Search completed in 0.002 seconds
|