login
a(n) = number of loopless diagrams by number of K_6 up to rotational symmetry.
5

%I #5 Nov 01 2021 22:31:44

%S 0,1,335,11508322,1324603148183,404760320241653655,

%T 282780723811372935744420

%N a(n) = number of loopless diagrams by number of K_6 up to rotational symmetry.

%H Evgeniy Krasko, Igor Labutin, and Alexander Omelchenko, <a href="https://arxiv.org/abs/1709.03218">Enumeration of Labelled and Unlabelled Hamiltonian Cycles in Complete k-partite Graphs</a>, arXiv:1709.03218 [math.CO], 2017. See Appendix Table 5.

%Y Cf. A190835, A348821, A348823; A007474, A348814, A348816, A348819.

%K nonn,more

%O 1,3

%A _Michael De Vlieger_, Nov 01 2021