Number of 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.

A337716

Number of 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) =2a(3) =4a(4) =8a(5) =16a(6) =35a(7) =77a(8) =179a(9) =440a(10) =1160a(11) =3264a(12) =9950a(13) =33206a(14) =121943a(15) =494011a(16) =2235399a(17) =11391306a(18) =65287199a(19) =422908306a(20) =3130775625a(21) =26490210964a(22) =255257056748

External references