Number of rooted simple connected graphs on n unlabeled nodes where every block is a complete graph with nonroot nodes of two colors.

A318494

Number of rooted simple connected graphs on n unlabeled nodes where every block is a complete graph with nonroot nodes of two colors.

Terms

    a(0) =1a(1) =2a(2) =10a(3) =50a(4) =285a(5) =1696a(6) =10647a(7) =68842a(8) =456922a(9) =3091546a(10) =21252396a(11) =147992264a(12) =1041779912a(13) =7401119718a(14) =52996414666a(15) =382095695324

External references