login
a(n) = number of loopless diagrams by number of K_6 up to all symmetries.
4

%I #5 Nov 02 2021 02:31:30

%S 0,1,203,5765385,662305416760,202380163158922023,

%T 141390361908351519807928

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

%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, A348822; A003437, A292409, A348817, A348820.

%K nonn,more

%O 1,3

%A _Michael De Vlieger_, Nov 01 2021