login
A348816
a(n) = number of loopless diagrams by number of K_4 up to rotational symmetry.
5
0, 1, 15, 4790, 4151415, 6619291247, 17510518983528, 71631394311300461, 429426878302882412435, 3616596939726424941979785
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 3.
KEYWORD
nonn,more
AUTHOR
Michael De Vlieger, Nov 01 2021
STATUS
approved