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

1, 2, 2, 2, 4, 4, 5

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