A292409 Number of Hamiltonian cycles in a Turan graph T(3n, n), up to isomorphisms.
1, 4, 83, 4848, 562713, 94810999, 21577786374, 6367912802891, 2366319275431001, 1081610451348718567, 596588083450068950934, 390803766837390136477505
Offset: 2
Links
- E. Krasko, I. Labutin, A. Omelchenko, Enumeration of Labelled and Unlabelled Hamiltonian Cycles in Complete k-partite Graphs, arXiv preprint arXiv:1709.03218[math.CO], 2017.