The number of simple labeled graphs on n nodes such that i) all connected components have exactly one cycle, ii) all vertices have degree at most 3, iii) vertices of degree 3 are on a cycle.
A201883
The number of simple labeled graphs on n nodes such that i) all connected components have exactly one cycle, ii) all vertices have degree at most 3, iii) vertices of degree 3 are on a cycle.
Terms
- a(0) =1a(1) =0a(2) =0a(3) =1a(4) =15a(5) =192a(6) =2530a(7) =36165a(8) =570507a(9) =9969400a(10) =192525084a(11) =4087525095a(12) =94813475185
External references
- oeis: A201883