Number of connected multigraphs with n edges and rooted at two indistinguishable vertices whose removal leaves a connected graph.
A338999
Number of connected multigraphs with n edges and rooted at two indistinguishable vertices whose removal leaves a connected graph.
Terms
- a(0) =1a(1) =1a(2) =3a(3) =11a(4) =43a(5) =180a(6) =804a(7) =3763a(8) =18331a(9) =92330a(10) =478795a(11) =2547885a(12) =13880832a(13) =77284220a(14) =439146427a(15) =2543931619a(16) =15010717722a(17) =90154755356a(18) =550817917537
External references
- oeis: A338999