Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091302
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091302 Number of equivalence classes of Hamiltonian cycles (or Gray codes) in the binary n-cube. +0
5
1, 1, 2, 112, 15109096 (list; graph; listen)
OFFSET

1,3

COMMENT

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.

CROSSREFS

Cf. A003042.

Sequence in context: A024342 A012525 A051590 this_sequence A042567 A142112 A053976

Adjacent sequences: A091299 A091300 A091301 this_sequence A091303 A091304 A091305

KEYWORD

nonn

AUTHOR

njas, following a suggestion of Gordon Royle, Feb 20 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research