A348820 a(n) = number of loopless diagrams by number of K_5 up to all symmetries.
0, 1, 42, 112418, 1105696796, 24178822553773, 1029696155560021174, 77938101941693076258854
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 4.