|
%I #25 Aug 15 2015 15:06:33
%S 0,0,2,10,58,616,9932,333386,25153932,4548577688
%N Total counts of distinct (directed) Hamiltonian cycles for all simple graphs of order n.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HamiltonianCycle.html">Hamiltonian Cycle</a>
%Y Cf. A193352 (total numbers of directed Hamiltonian paths for simple graphs on n nodes).
%Y Cf. A234601 (total numbers of undirected cycles for simple graphs on n nodes).
%K nonn,more,hard
%O 1,3
%A _Eric W. Weisstein_, Nov 14 2006
%E a(7)-a(10) from _Eric W. Weisstein_, Jul 23-24 2011
|
