A284673 Number of (undirected) Hamiltonian paths in the n-hypercube graph Q_n.

0, 1, 4, 72, 45696, 93749829120

Offset: 0

Author

Eric W. Weisstein, Apr 01 2017

Keywords

• nonn
• hard
• more

Links

• Eric Weisstein's World of Mathematics, Hamiltonian Path
• Eric Weisstein's World of Mathematics, Hypercube Graph

Crossrefs

Cf. A091299.

Programs

Mathematica

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 *)

Formula

a(n) = A091299(n) / 2 for n > 0. - Andrew Howroyd, May 09 2017