login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

%I #7 Nov 01 2021 22:31:15

%S 0,1,60,222477,2211192688,48357603758012,2059392303708166507,

%T 155876203880714141444480

%N a(n) = number of loopless diagrams by number of K_5 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 4.

%Y Cf. A190833, A348818, A348820; A007474, A348814, A348816, A348822.

%K nonn,more

%O 1,3

%A _Michael De Vlieger_, Nov 01 2021