|
| |
|
|
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
| | |
|
|
|
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: A112801 A173862 A089873 * A035682 A054543 A029046
Adjacent sequences: A096320 A096321 A096322 * A096324 A096325 A096326
|
|
|
KEYWORD
| hard,nonn
|
|
|
AUTHOR
| Jud McCranie (JudMcCranie(AT)ugaalum.uga.edu), Jun 28 2004
|
| |
|
|
