Number of unlabeled simple graphs with n vertices and n edges such that it is not possible to choose a different vertex from each edge (non-choosable).
A369201
Number of unlabeled simple graphs with n vertices and n edges such that it is not possible to choose a different vertex from each edge (non-choosable).
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =1a(6) =7a(7) =30a(8) =124a(9) =507a(10) =2036a(11) =8216a(12) =33515a(13) =138557a(14) =583040a(15) =2503093a(16) =10985364a(17) =49361893a(18) =227342301a(19) =1073896332a(20) =5204340846a(21) =25874724616a(22) =131937166616a(23) =689653979583
External references
- oeis: A369201