cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A326899 Number of unlabeled connectedness systems covering n vertices without singletons.

Original entry on oeis.org

1, 0, 1, 4, 41, 3048, 26894637
Offset: 0

Views

Author

Gus Wiseman, Aug 02 2019

Keywords

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.

Examples

			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).
The labeled version is A326877.

Extensions

a(6) corrected by Andrew Howroyd, Oct 28 2023