Number of unlabeled connected simple graphs with n edges rooted at two indistinguishable vertices.
A339041
Number of unlabeled connected simple graphs with n edges rooted at two indistinguishable vertices.
Terms
- a(0) =1a(1) =2a(2) =7a(3) =21a(4) =73a(5) =255a(6) =946a(7) =3618a(8) =14376a(9) =58957a(10) =249555a(11) =1087828a(12) =4878939a(13) =22488282a(14) =106432530a(15) =516783762a(16) =2572324160a(17) =13116137104a(18) =68461594211a(19) =365559412868
External references
- oeis: A339041