login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of Hamiltonian cycles in a Turan graph T(3n, n), up to isomorphisms.
5

%I #13 Sep 17 2017 23:25:04

%S 1,4,83,4848,562713,94810999,21577786374,6367912802891,

%T 2366319275431001,1081610451348718567,596588083450068950934,

%U 390803766837390136477505

%N Number of Hamiltonian cycles in a Turan graph T(3n, n), up to isomorphisms.

%H E. Krasko, I. Labutin, A. Omelchenko, <a href="https://arxiv.org/abs/1709.03218">Enumeration of Labelled and Unlabelled Hamiltonian Cycles in Complete k-partite Graphs</a>, arXiv preprint arXiv:1709.03218[math.CO], 2017.

%K nonn,more

%O 2,2

%A _Evgeniy Krasko_, Sep 15 2017