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.

A322397 Number of 2-edge-connected clutters spanning n vertices.

Original entry on oeis.org

0, 0, 4, 71, 5927
Offset: 1

Views

Author

Gus Wiseman, Dec 06 2018

Keywords

Comments

A clutter is a connected antichain of sets. It is 2-edge-connected if it cannot be disconnected by removing any single edge. Compare to blobs or 2-vertex-connected clutters (A275307).

Examples

			The a(3) = 4 clutters:
  {{1,3},{2,3}}
  {{1,2},{2,3}}
  {{1,2},{1,3}}
  {{1,2},{1,3},{2,3}}
		

Crossrefs