A337717 Number of connected graphs, where vertices are labeled with positive integers summing to n, and where identically labeled vertices are indistinguishable and cannot be connected with an edge.

1, 1, 1, 2, 3, 6, 12, 28, 65, 173, 496, 1527, 5092, 18669, 74601, 325206, 1572191, 8487232, 50962240, 343162568, 2627538015, 22853622935, 225118360626, 2539559186827, 33036542404276, 491977100299885, 8394837931641837

Offset: 0

Author

Max Alekseyev following a suggestion from Franklin T. Adams-Watters, Sep 16 2020

Keywords

• nonn

Links

• Max Alekseyev, Table of n, a(n) for n = 0..30

Crossrefs

Inverse Euler transform of A337716.