Number of connected graphs on n unlabeled nodes that contain at least two cycles.
A140636
Number of connected graphs on n unlabeled nodes that contain at least two cycles.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =2a(4) =13a(5) =93a(6) =809a(7) =11005a(8) =260793a(9) =11715808a(10) =1006698524a(11) =164059824899
External references
- oeis: A140636