The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #5 Nov 01 2021 22:31:24
%S 0,1,42,112418,1105696796,24178822553773,1029696155560021174,
%T 77938101941693076258854
%N a(n) = number of loopless diagrams by number of K_5 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 4.
%Y Cf. A190833, A348818, A348819; A003437, A292409, A348817, A348823.
%K nonn,more
%O 1,3
%A _Michael De Vlieger_, Nov 01 2021