login
A348822
a(n) = number of loopless diagrams by number of K_6 up to rotational symmetry.
5
0, 1, 335, 11508322, 1324603148183, 404760320241653655, 282780723811372935744420
OFFSET
1,3
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.
KEYWORD
nonn,more
AUTHOR
Michael De Vlieger, Nov 01 2021
STATUS
approved