Number of simple connected graphs on n unlabeled nodes with each node a member of exactly one cycle.

A380632

Number of simple connected graphs on n unlabeled nodes with 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) =5a(10) =9a(11) =14a(12) =28a(13) =49a(14) =95a(15) =182a(16) =369a(17) =733a(18) =1509a(19) =3103a(20) =6504a(21) =13627a(22) =28949a(23) =61701a(24) =132457a(25) =285454a(26) =618863a(27) =1346022a(28) =2940287a(29) =6444364

External references