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”).
%I #19 Dec 30 2013 04:03:46
%S 0,2,8,50,416,5616,117308,4862736,435732112,89647085656
%N Total counts of distinct (directed) Hamiltonian paths for all simple graphs of order n.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HamiltonianPath.html">Hamiltonian Path</a>
%Y Cf. A124964 (total count of directed Hamiltonian cycles for simple graphs on n nodes).
%Y Cf. A234601 (total count of undirected cycles for simple graphs on n nodes).
%K nonn,hard,more
%O 1,2
%A _Eric W. Weisstein_, Jul 23 2011
%E a(8) from _Eric W. Weisstein_, Jul 24 2011
%E a(9) from _Eric W. Weisstein_, Dec 28 2013
%E a(10) from _Eric W. Weisstein_, Dec 29 2013