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.

A305854 Number of unlabeled spanning intersecting set-systems on n vertices.

Original entry on oeis.org

1, 1, 2, 10, 110, 14868, 1289830592
Offset: 0

Views

Author

Gus Wiseman, Jun 11 2018

Keywords

Comments

An intersecting set-system S is a finite set of finite nonempty sets (edges), any two of which have a nonempty intersection. S is spanning if every vertex is contained in some edge.

Examples

			Non-isomorphic representatives of the a(3) = 10 spanning intersecting set-systems:
  {{1,2,3}}
  {{3},{1,2,3}}
  {{1,3},{2,3}}
  {{2,3},{1,2,3}}
  {{3},{1,3},{2,3}}
  {{3},{2,3},{1,2,3}}
  {{1,2},{1,3},{2,3}}
  {{1,3},{2,3},{1,2,3}}
  {{3},{1,3},{2,3},{1,2,3}}
  {{1,2},{1,3},{2,3},{1,2,3}}
		

Crossrefs

Formula

a(n) = A305856(n) - A305856(n-1) for n > 0. - Andrew Howroyd, Aug 12 2019

Extensions

a(5) from Andrew Howroyd, Aug 12 2019
a(6) from Bert Dobbelaere, Apr 28 2025