|
|
A326945
|
|
Number of T_0 sets of subsets of {1..n} that are closed under intersection.
|
|
8
|
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
The dual of a multiset partition has, for each vertex, one block consisting of the indices (or positions) of the blocks containing that vertex. For example, the dual of {{1,2},{2,3}} is {{1},{1,2},{2}}. The T_0 condition means that the dual is strict (no repeated edges).
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The a(0) = 2 through a(2) = 12 sets of subsets:
{} {} {}
{{}} {{}} {{}}
{{1}} {{1}}
{{},{1}} {{2}}
{{},{1}}
{{},{2}}
{{1},{1,2}}
{{2},{1,2}}
{{},{1},{2}}
{{},{1},{1,2}}
{{},{2},{1,2}}
{{},{1},{2},{1,2}}
|
|
MATHEMATICA
|
Table[Length[Select[Subsets[Subsets[Range[n]]], UnsameQ@@dual[#]&&SubsetQ[#, Intersection@@@Tuples[#, 2]]&]], {n, 0, 3}]
|
|
CROSSREFS
|
The version not closed under intersection is A326941.
The case without empty edges is A326959.
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|