|
Search: id:A006070
|
|
|
| A006070 |
|
Number of Hamiltonian paths on n-cube which are strictly not cycles.
(Formerly M5295)
|
|
+0
6
|
| |
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
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
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
M. Gardner, Knotted Doughnuts and Other Mathematical Entertainments. Freeman, NY, 1986, p. 24.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
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.
Adjacent sequences: A006067 A006068 A006069 this_sequence A006071 A006072 A006073
Sequence in context: A164278 A159441 A011787 this_sequence A081262 A008704 A037947
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
a(5) from Greg Barton (greg_barton(AT)yahoo.com), May 24 2004
|
|
|
Search completed in 0.002 seconds
|
