Number of sets of rooted connected graphs where every block is a complete graph.

A035052

Number of sets of rooted connected graphs where every block is a complete graph.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =5a(4) =14a(5) =42a(6) =134a(7) =444a(8) =1518a(9) =5318a(10) =18989a(11) =68856a(12) =252901a(13) =938847a(14) =3517082a(15) =13278844a(16) =50475876a(17) =193014868a(18) =741963015a(19) =2865552848a(20) =11113696421a(21) =43266626430a(22) =169019868095a(23) =662337418989

External references