|
|
A003042
|
|
Number of directed Hamiltonian cycles (or Gray codes) on n-cube.
(Formerly M2053)
|
|
12
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Finding a(6) is Problem 43 in the Knuth reference.
|
|
REFERENCES
|
Martin Gardner, Knotted Doughnuts and Other Mathematical Entertainments. Freeman, NY, 1986, p. 24.
Donald E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, (to appear), section 7.2.1.1.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,nice,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(6) from Michel Deza, Mar 28 2010
a(6) corrected by Haanpaa and Östergård, 2012. - N. J. A. Sloane, Sep 06 2012
|
|
STATUS
|
approved
|
|
|
|