Number of unlabeled loop-graphs covering n vertices such that it is possible to choose a different vertex from each edge (choosable).

A369200

Number of unlabeled loop-graphs covering n vertices such that it is possible to choose a different vertex from each edge (choosable).

Terms

    a(0) =1a(1) =1a(2) =3a(3) =7a(4) =18a(5) =43a(6) =112a(7) =282a(8) =740a(9) =1940a(10) =5182a(11) =13916a(12) =37826a(13) =103391a(14) =284815a(15) =788636a(16) =2195414a(17) =6137025a(18) =17223354a(19) =48495640a(20) =136961527a(21) =387819558a(22) =1100757411a(23) =3130895452a(24) =8922294498a(25) =25470279123a(26) =72823983735a(27) =208515456498a(28) =597824919725

External references