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.

A326871 Number of unlabeled connectedness systems covering n vertices.

Original entry on oeis.org

1, 1, 4, 24, 436, 80460, 1689114556
Offset: 0

Views

Author

Gus Wiseman, Jul 29 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. It is covering if every vertex belongs to some edge.

Examples

			Non-isomorphic representatives of the a(0) = 1 through a(3) = 24 connectedness systems:
  {}  {{1}}  {{1,2}}          {{1,2,3}}
             {{1},{2}}        {{1},{2,3}}
             {{2},{1,2}}      {{1},{2},{3}}
             {{1},{2},{1,2}}  {{3},{1,2,3}}
                              {{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 non-covering case without singletons is A072444.
The case without singletons is A326899.
First differences of A326867 (the non-covering case).
Euler transform of A326869 (the connected case).
The labeled case is A326870.

Extensions

a(5) from Andrew Howroyd, Aug 10 2019
a(6) from Andrew Howroyd, Oct 28 2023