OFFSET
0,4
COMMENTS
We define a connectedness system to be a set of finite nonempty sets (edges) that is closed under taking the union of any two overlapping edges. It is connected if it is empty or contains an edge with all the vertices. Then a(n) is the number of unlabeled connected connectedness systems without singletons on n vertices. - Gus Wiseman, Aug 01 2019
LINKS
FORMULA
Inverse Euler transform of A072444. - Andrew Howroyd, Oct 28 2023
EXAMPLE
a(3) = 4 because of the 4 sets: {{1}, {2}, {3}, {1, 2, 3}}; {{1}, {2}, {3}, {1, 2}, {1, 2, 3}}; {{1}, {2}, {3}, {1, 2}, {1, 3}, {1, 2, 3}}; {{1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}}.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Wim van Dam (vandam(AT)cs.berkeley.edu), Jun 18 2002
EXTENSIONS
a(0)=1 prepended and a(6) corrected by Andrew Howroyd, Oct 28 2023
STATUS
approved