Number of connected graphs on n unlabeled nodes with exactly 2 cycles joined along two or more edges but not more than half each cycle and all nodes having degree at most 4.
A305132
Number of connected graphs on n unlabeled nodes with exactly 2 cycles joined along two or more edges but not more than half each cycle and all nodes having degree at most 4.
Terms
- a(0) =1a(1) =3a(2) =11a(3) =36a(4) =116a(5) =366a(6) =1151a(7) =3583a(8) =11093a(9) =34141a(10) =104489a(11) =318139a(12) =963899a(13) =2907276a(14) =8731919a(15) =26125538a(16) =77889504a(17) =231466147a(18) =685811867a(19) =2026481941a(20) =5973064855a(21) =17565416721a(22) =51547293439a(23) =150977445294a(24) =441409701444
External references
- oeis: A305132