login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096323 a(n) is the maximum value such that an n-bit Gray (code) cycle can be found in which all runs have length >= a(n). 0
1, 2, 2, 2, 4, 4, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Exercise 62 in Knuth asks if a(8)=6. a(10) >= 8 (exercise 63) and is "almost certainly" 8 (Knuth).

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..7.

CROSSREFS

Sequence in context: A173862 A089873 A275433 * A282562 A035682 A054543

Adjacent sequences: A096320 A096321 A096322 * A096324 A096325 A096326

KEYWORD

hard,nonn

AUTHOR

Jud McCranie, Jun 28 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 30 00:59 EST 2023. Contains 359939 sequences. (Running on oeis4.)