Number of connected loopless multigraphs with n edges rooted at two noninterchangeable vertices whose removal leaves a connected graph.
A339045
Number of connected loopless multigraphs with n edges rooted at two noninterchangeable vertices whose removal leaves a connected graph.
Terms
- a(0) =1a(1) =1a(2) =4a(3) =16a(4) =69a(5) =307a(6) =1433a(7) =6903a(8) =34337a(9) =175457a(10) =919525a(11) =4931233a(12) =27023894a(13) =151142376a(14) =861880778a(15) =5006906170a(16) =29611120248a(17) =178175786593
External references
- oeis: A339045