|
|
A326904
|
|
Number of unlabeled set-systems (without {}) on n vertices that are closed under intersection.
|
|
5
|
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
A set-system is a finite set of finite nonempty sets, so no two edges of such a set-system can be disjoint.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Non-isomorphic representatives of the a(0) = 1 through a(3) = 10 set-systems:
{} {} {} {}
{{1}} {{1}} {{1}}
{{1,2}} {{1,2}}
{{2},{1,2}} {{1,2,3}}
{{2},{1,2}}
{{3},{1,2,3}}
{{2,3},{1,2,3}}
{{3},{1,3},{2,3}}
{{3},{2,3},{1,2,3}}
{{3},{1,3},{2,3},{1,2,3}}
|
|
CROSSREFS
|
The covering case is A108800(n - 1).
The case with an edge containing all of the vertices is A193674(n - 1).
The case with union instead of intersection is A193674.
Cf. A000798, A001930, A006058, A102895, A102898, A326876, A326866, A326878, A326882, A326903, A326906.
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|