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
%I A091302
%S A091302 1,1,2,112,15109096
%N A091302 Number of equivalence classes of Hamiltonian cycles (or Gray codes) in 
               the binary n-cube.
%C A091302 A066037(n)/(n!/2). See A006069, A003042, A066037 for more information.
%D A091302 D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial 
               Algorithms, (to appear), section 7.2.1.1.
%Y A091302 Cf. A003042.
%Y A091302 Sequence in context: A012525 A165975 A051590 this_sequence A042567 A142112 
               A053976
%Y A091302 Adjacent sequences: A091299 A091300 A091301 this_sequence A091303 A091304 
               A091305
%K A091302 nonn
%O A091302 1,3
%A A091302 N. J. A. Sloane (njas(AT)research.att.com), following a suggestion of 
               Gordon Royle, Feb 20 2004

    
page 1

Search completed in 0.001 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 December 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research