login
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
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.
CROSSREFS
Sequence in context: A173862 A089873 A275433 * A282562 A035682 A054543
KEYWORD
hard,nonn
AUTHOR
Jud McCranie, Jun 28 2004
STATUS
approved