A337717 - cp's OEIS frontend

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.

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

cp's OEIS Frontend

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.