%I #15 Apr 28 2021 19:09:15
%S 1,1,1,2,3,6,12,28,65,173,496,1527,5092,18669,74601,325206,1572191,
%T 8487232,50962240,343162568,2627538015,22853622935,225118360626,
%U 2539559186827,33036542404276,491977100299885,8394837931641837
%N 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.
%H Max Alekseyev, <a href="/A337717/b337717.txt">Table of n, a(n) for n = 0..30</a>
%Y Inverse Euler transform of A337716.
%K nonn
%O 0,4
%A _Max Alekseyev_ following a suggestion from _Franklin T. AdamsWatters_, Sep 16 2020
