A348823 a(n) = number of loopless diagrams by number of K_6 up to all symmetries.
0, 1, 203, 5765385, 662305416760, 202380163158922023, 141390361908351519807928
Offset: 1
Links
- Evgeniy Krasko, Igor Labutin, and Alexander Omelchenko, Enumeration of Labelled and Unlabelled Hamiltonian Cycles in Complete k-partite Graphs, arXiv:1709.03218 [math.CO], 2017. See Appendix Table 5.