login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091302 Number of equivalence classes of directed Hamiltonian cycles (or Gray codes) in the binary n-cube with one node marked. 8
1, 1, 2, 112, 15109096, 99550593673808010752 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Equals A066037(n)/(n!/2). See A006069, A003042, A066037 for more information.

REFERENCES

D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, (to appear), section 7.2.1.1.

LINKS

Table of n, a(n) for n=1..6.

Michel Deza and Roman Shklyar, Enumeration of Hamiltonian Cycles in 6-cube, arXiv:1003.4391v1 [There may be errors - see Haanpaa and Ostergard, 2012]

Harri Haanpaa and Patric R. J. Östergård, Counting Hamiltonian cycles in bipartite graphs, Math. Comp., 88 (2014) 979-995. Final version available from http://users.tkk.fi/pat/.

CROSSREFS

Cf. A006069, A003042, A066037, A159344.

Sequence in context: A012525 A165975 A051590 * A209611 A042567 A142112

Adjacent sequences:  A091299 A091300 A091301 * A091303 A091304 A091305

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, following a suggestion of Gordon Royle, Feb 20 2004

EXTENSIONS

a(6) from Michel Deza, Mar 28 2010

a(6) corrected by Haanpaa and Östergård, 2012, who also provided a more precise definition. - N. J. A. Sloane, Sep 06 2012

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 5 23:10 EDT 2020. Contains 334858 sequences. (Running on oeis4.)