login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 3

%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. Adams-Watters_, Sep 16 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 04:44 EDT 2024. Contains 371756 sequences. (Running on oeis4.)