Number of increasing asymmetric rooted connected graphs where every block is a complete graph.
A035081
Number of increasing asymmetric rooted connected graphs where every block is a complete graph.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =7a(4) =27a(5) =167a(6) =1451a(7) =12672a(8) =133356a(9) =1573608a(10) =20731512a(11) =299642958a(12) =4732486932a(13) =81201040470
External references
- oeis: A035081