Number of unlabeled connected loop-less graphs on n nodes containing exactly one cycle (of length at least 2) and with all nodes of degree <= 4.

A002094

Number of unlabeled connected loop-less graphs on n nodes containing exactly one cycle (of length at least 2) and with all nodes of degree <= 4.

Terms

    a(0) =0a(1) =1a(2) =2a(3) =5a(4) =10a(5) =25a(6) =56a(7) =139a(8) =338a(9) =852a(10) =2145a(11) =5513a(12) =14196a(13) =36962a(14) =96641a(15) =254279a(16) =671640a(17) =1781840a(18) =4742295a(19) =12662282a(20) =33898923a(21) =90981264a(22) =244720490a(23) =659591378a(24) =1781048728a(25) =4817420360a(26) =13050525328a(27) =35405239155a(28) =96180222540a(29) =261603173201

External references