Number of labeled loop-graphs covering {1..n} such that it is not possible to choose a different vertex from each edge (non-choosable).
A369142
Number of labeled loop-graphs covering {1..n} 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) =22a(4) =616a(5) =26084a(6) =1885323a(7) =253923163a(8) =66619551326
External references
- oeis: A369142