Number of unlabeled n-edge loop-graphs with at most n vertices such that it is not possible to choose a different vertex from each edge.
A368835
Number of unlabeled n-edge loop-graphs with at most n vertices such that it is not possible to choose a different vertex from each edge.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =1a(4) =5a(5) =23a(6) =98a(7) =394a(8) =1560a(9) =6181a(10) =24655a(11) =99701a(12) =410513a(13) =1725725a(14) =7423757a(15) =32729320a(16) =148027044a(17) =687188969a(18) =3275077017a(19) =16022239940a(20) =80431483586a(21) =414094461610
External references
- oeis: A368835