A327424
Number of unlabeled, non-connected or empty antichains of nonempty subsets of {1..n}.
Original entry on oeis.org
1, 1, 2, 4, 10, 33, 234, 16579
Offset: 0
Non-isomorphic representatives of the a(0) = 1 through a(4) = 10 antichains:
{} {} {} {} {}
{{1},{2}} {{1},{2}} {{1},{2}}
{{1},{2,3}} {{1},{2,3}}
{{1},{2},{3}} {{1},{2},{3}}
{{1},{2,3,4}}
{{1,2},{3,4}}
{{1},{2},{3,4}}
{{1},{2},{3},{4}}
{{1},{2,4},{3,4}}
{{1},{2,3},{2,4},{3,4}}
Partial sums of the positive-index terms of
A327426.
The labeled covering case is
A120338.
Unlabeled antichains that are either not connected or not covering are
A327437.
The case without empty antichains is
A327808.
A327807
Triangle read by rows where T(n,k) is the number of unlabeled antichains of sets with n vertices and vertex-connectivity >= k.
Original entry on oeis.org
1, 2, 0, 4, 1, 0, 9, 3, 2, 0, 29, 14, 10, 6, 0, 209, 157, 128, 91, 54, 0
Offset: 0
Triangle begins:
1
2 0
4 1 0
9 3 2 0
29 14 10 6 0
209 157 128 91 54 0
Except for the first column, same as
A327358 (the covering case).
Showing 1-2 of 2 results.
Comments