Number of unlabeled simple connected graphs with n nodes of degree at most 3 and each node a member of exactly one cycle.
A380805
Number of unlabeled simple connected graphs with n nodes of degree at most 3 and each node a member of exactly one cycle.
Terms
- a(0) =1a(1) =0a(2) =0a(3) =1a(4) =1a(5) =1a(6) =2a(7) =2a(8) =3a(9) =4a(10) =7a(11) =10a(12) =18a(13) =27a(14) =49a(15) =81a(16) =147a(17) =256a(18) =476a(19) =858a(20) =1612a(21) =2991a(22) =5676a(23) =10729a(24) =20575a(25) =39423a(26) =76232a(27) =147602a(28) =287518a(29) =561195
External references
- oeis: A380805