|
|
A198085
|
|
Number of nonempty connected, containment-free subsets of 2^[n]. Total number of clutters on all subsets of [n]. Number of connected antichains in the Boolean algebra B_n (the poset of subsets of [n] ordered by containment).
|
|
9
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The restriction to (spanning hypergraphs = maximal antichains = clutters on [n]) is considered in A048143.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
For n=3: {{1}}, {{2}}, {{3}}, {{12}}, {{13}}, {{23}}, {{123}}, {{12}{13}}, {{12}{23}}, {{13}{23}}, {{12}{13}{23}}.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|