Number of labeled loop-graphs covering a subset of {1..n} such that it is not possible to choose a different vertex from each edge (non-choosable).
A369141
Number of labeled loop-graphs covering a subset of {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) =25a(4) =710a(5) =29394a(6) =2051522a(7) =267690539a(8) =68705230758
External references
- oeis: A369141