A006070 Number of Hamiltonian paths on n-cube which are strictly not cycles.

0, 0, 48, 48384, 129480729600

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn
• hard
• more

Comments

Number of Gray codes of length n which strictly do not close.

More precisely, this is the number of ways of making a list of the 2^n nodes of the n-cube, with a distinguished starting position and a direction, such that each node is adjacent to the previous one and the last node is not adjacent to the first.

Examples

			There are no such paths for n=1 or n=2 (the square). For n = 3 every path has to end at the node of the cube that is diametrically opposite to the start. There are 16 choices for the start and for each start there are 3 Hamiltonian paths that end at the opposite node, so a(3) = 3*16 = 48.
		

References

• M. Gardner, Knotted Doughnuts and Other Mathematical Entertainments. Freeman, NY, 1986, p. 24.
• N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

• Eric Weisstein's World of Mathematics, Hypercube Graph

Crossrefs

Cf. A006069, A091299.

Formula

a(n) = A091299(n) - A006069(n). - Andrew Howroyd, Dec 25 2021

Extensions

a(5) from Greg Barton (greg_barton(AT)yahoo.com), May 24 2004