|
|
A326899
|
|
Number of unlabeled connectedness systems covering n vertices without singletons.
|
|
1
|
|
|
|
OFFSET
|
0,4
|
|
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
|
|
|
EXAMPLE
|
Non-isomorphic representatives of the a(3) = 4 connectedness systems:
{{1,2,3}}
{{2,3},{1,2,3}}
{{1,3},{2,3},{1,2,3}}
{{1,2},{1,3},{2,3},{1,2,3}}
|
|
CROSSREFS
|
The case with singletons is A326871.
First differences of A072444 (the non-covering case).
Euler transform of A072445 (the connected case).
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|