login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A326867
Number of unlabeled connectedness systems on n vertices.
16
1, 2, 6, 30, 466, 80926, 1689195482
OFFSET
0,2
COMMENTS
We define a connectedness system (investigated by Vim van Dam in 2002) to be a set of finite nonempty sets (edges) that is closed under taking the union of any two overlapping edges.
LINKS
Gus Wiseman, Every Clutter Is a Tree of Blobs, The Mathematica Journal, Vol. 19, 2017.
EXAMPLE
Non-isomorphic representatives of the a(0) = 1 through a(3) = 30 connectedness systems:
{} {} {} {}
{{1}} {{1}} {{1}}
{{1,2}} {{1,2}}
{{1},{2}} {{1},{2}}
{{2},{1,2}} {{1,2,3}}
{{1},{2},{1,2}} {{1},{2,3}}
{{2},{1,2}}
{{1},{2},{3}}
{{3},{1,2,3}}
{{1},{2},{1,2}}
{{1},{3},{2,3}}
{{2,3},{1,2,3}}
{{2},{3},{1,2,3}}
{{1},{2,3},{1,2,3}}
{{1},{2},{3},{2,3}}
{{3},{2,3},{1,2,3}}
{{1},{2},{3},{1,2,3}}
{{1,3},{2,3},{1,2,3}}
{{1},{3},{2,3},{1,2,3}}
{{2},{3},{2,3},{1,2,3}}
{{2},{1,3},{2,3},{1,2,3}}
{{3},{1,3},{2,3},{1,2,3}}
{{1,2},{1,3},{2,3},{1,2,3}}
{{1},{2},{3},{2,3},{1,2,3}}
{{1},{2},{1,3},{2,3},{1,2,3}}
{{2},{3},{1,3},{2,3},{1,2,3}}
{{3},{1,2},{1,3},{2,3},{1,2,3}}
{{1},{2},{3},{1,3},{2,3},{1,2,3}}
{{2},{3},{1,2},{1,3},{2,3},{1,2,3}}
{{1},{2},{3},{1,2},{1,3},{2,3},{1,2,3}}
CROSSREFS
The case without singletons is A072444.
The labeled case is A326866.
The connected case is A326869.
Partial sums of A326871 (the covering case).
Sequence in context: A076926 A092023 A112723 * A320830 A074777 A007280
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Jul 29 2019
EXTENSIONS
a(5) from Andrew Howroyd, Aug 10 2019
a(6) from Andrew Howroyd, Oct 28 2023
STATUS
approved