A322397 - OEIS

A322397

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

0, 0, 4, 71, 5927

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

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).

LINKS

Table of n, a(n) for n=1..5.

EXAMPLE

The a(3) = 4 clutters:

{{1,3},{2,3}}

{{1,2},{2,3}}

{{1,2},{1,3}}

{{1,2},{1,3},{2,3}}

CROSSREFS

Cf. A001187, A013922, A030019, A048143, A095983, A275307, A317634, A317635, A317672, A322335, A322393, A322395, A322399.

Sequence in context: A047939 A354859 A088693 * A333543 A262235 A133003

Adjacent sequences: A322394 A322395 A322396 * A322398 A322399 A322400

KEYWORD

nonn,more

AUTHOR

Gus Wiseman, Dec 06 2018

STATUS

approved