A348817 a(n) = number of loopless diagrams by number of K_4 up to all symmetries.
0, 1, 13, 2576, 2081393, 3309962320, 8755277273334, 35815698613833466, 214713439275724149414, 1808298469877117320495867
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 3.