login
A348819
a(n) = number of loopless diagrams by number of K_5 up to rotational symmetry.
5
0, 1, 60, 222477, 2211192688, 48357603758012, 2059392303708166507, 155876203880714141444480
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 4.
KEYWORD
nonn,more
AUTHOR
Michael De Vlieger, Nov 01 2021
STATUS
approved