The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A006070 Number of Hamiltonian paths on n-cube which are strictly not cycles. (Formerly M5295) 7
 0, 0, 48, 48384, 129480729600 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 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. 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 FORMULA a(n) = A091299(n) - A006069(n). - Andrew Howroyd, Dec 25 2021 EXAMPLE 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. CROSSREFS Cf. A006069, A091299. Sequence in context: A011787 A345646 A292516 * A081262 A340186 A238001 Adjacent sequences:  A006067 A006068 A006069 * A006071 A006072 A006073 KEYWORD nonn,hard,more AUTHOR EXTENSIONS a(5) from Greg Barton (greg_barton(AT)yahoo.com), May 24 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 24 13:11 EST 2022. Contains 350538 sequences. (Running on oeis4.)