Number of connected graphs on n unlabeled nodes where every block is a complete graph.

A035053

Number of connected graphs on n unlabeled nodes where every block is a complete graph.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =4a(5) =9a(6) =22a(7) =59a(8) =165a(9) =496a(10) =1540a(11) =4960a(12) =16390a(13) =55408a(14) =190572a(15) =665699a(16) =2354932a(17) =8424025a(18) =30424768a(19) =110823984a(20) =406734060a(21) =1502876903a(22) =5586976572a(23) =20884546416a(24) =78460794158a(25) =296124542120

External references