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 May 09 2017 22:39:27
%S 0,1,4,72,45696,93749829120
%N Number of (undirected) Hamiltonian paths in the n-hypercube graph Q_n.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HamiltonianPath.html">Hamiltonian Path</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HypercubeGraph.html">Hypercube Graph</a>
%F a(n) = A091299(n) / 2 for n > 0. - _Andrew Howroyd_, May 09 2017
%t Table[Total[Flatten[Table[Length[FindPath[HypercubeGraph[n], i, j, {2^n - 1}, All]], {j, 2^n}, {i, j - 1}]]], {n, 0, 4}] (* _Eric W. Weisstein_, Apr 01 2017 *)
%Y Cf. A091299.
%K nonn,hard,more
%O 0,3
%A _Eric W. Weisstein_, Apr 01 2017