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

A369145

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

Terms

    a(0) =1a(1) =2a(2) =5a(3) =12a(4) =30a(5) =73a(6) =185a(7) =467a(8) =1207a(9) =3147a(10) =8329a(11) =22245a(12) =60071a(13) =163462a(14) =448277a(15) =1236913a(16) =3432327a(17) =9569352a(18) =26792706a(19) =75288346a(20) =212249873a(21) =600069431a(22) =1700826842a(23) =4831722294a(24) =13754016792a(25) =39224295915a(26) =112048279650a(27) =320563736148a(28) =918388655873

External references