login
A348814
a(n) = number of loopless diagrams by number of K_3 up to rotational symmetry.
4
0, 1, 4, 126, 9367, 1120780, 189565588, 43154533233, 12735808866899, 4732638168795171, 2163220895025390670, 1193176166690983987122, 781607533669746761791541
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 2.
KEYWORD
nonn,more
AUTHOR
Michael De Vlieger, Nov 01 2021
STATUS
approved