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

0, 1, 4, 72, 45696, 93749829120

Offset

0,3

Links

Table of n, a(n) for n=0..5.

Eric Weisstein's World of Mathematics, Hamiltonian Path

Eric Weisstein's World of Mathematics, Hypercube Graph

Formula

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

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

Crossrefs

Cf. A091299.

Sequence in context: A081460 A327040 A327112 * A055556 A168299 A089665

Adjacent sequences: A284670 A284671 A284672 * A284674 A284675 A284676

Keyword

nonn,hard,more

Author

Eric W. Weisstein, Apr 01 2017

Status

approved