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.

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.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =3a(5) =6a(6) =12a(7) =28a(8) =65a(9) =173a(10) =496a(11) =1527a(12) =5092a(13) =18669a(14) =74601a(15) =325206a(16) =1572191a(17) =8487232a(18) =50962240a(19) =343162568a(20) =2627538015a(21) =22853622935a(22) =225118360626

External references