A317631 Number of connected set partitions of the edges of labeled graphs with n vertices.

1, 1, 1, 8, 200, 15901

Offset

0,4

Comments

In the terminology of my linked article, a(n) counts caps of connected graphs. - Gus Wiseman, Sep 06 2025

Links

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

Gus Wiseman, All 200 connected set partitions of labeled graphs with 4 vertices.

Gus Wiseman, Every Clutter Is a Tree of Blobs, The Mathematica Journal, Vol. 19, 2017.

Crossrefs

Cf. A000110, A001187, A006125, A048143, A293510, A304717, A317632.

A317634 counts caps (also clutter partitions) of clutters covering n vertices.

A317635 counts connected vertex sets of clutters covering n vertices.

Cf. A000272, A007718, A056156, A125702, A147878, A275307, A318697, A320921.

Sequence in context: A034861 A221121 A264124 * A309904 A241224 A259065

Adjacent sequences: A317628 A317629 A317630 * A317632 A317633 A317634

Keyword

nonn,more

Author

Gus Wiseman, Aug 02 2018

Extensions

Name modified by Gus Wiseman, Sep 06 2025

Status

approved