Number of unlabeled loop-graphs with up to n vertices such that it is not possible to choose a different vertex from each edge (non-choosable).
A369146
Number of unlabeled loop-graphs with up to n vertices such that it is not possible to choose a different vertex from each edge (non-choosable).
Terms
- a(0) =0a(1) =0a(2) =1a(3) =8a(4) =60a(5) =471a(6) =4911a(7) =78797a(8) =2207405a(9) =113740613a(10) =10926218807
External references
- oeis: A369146