Work

A Mex Sequence That Is Not Ultimately Periodic

Year: 2026
Type: preprint
Abstract: Start with a few nonnegative integers and keep appending the least nonnegative integer that is not a sum ai + an−i of two terms whose indices add up to the last index n already written. Guy asked whether every such mex sequence is ultimately periodic. It is not: the sequence that starts 1, 1, 1, 0, 1, 0, 1, 1 is unbounded. The proof needs two facts. The zeros of the sequence sit at the positions with remainder 0 or 3 modulo 5, and each zero copies an earlier value into the set whose least missing element is taken, so from the third block of five on, each new twin value differs from every earlier twin value. An appendix gives every term exactly. Both proofs are formally verified in Lean. This record is identical to the folder mex-sequence-not-periodic at tag mex-sequence-not-periodic-v3 of https://github.com/jvvk/mathematics (paper, verification programs, Lean 4 project). Version 3 of the preprint; versions 1 and 2 were released on GitHub only.
Language: English
Open Access status: green
OpenAlex ID: W7235928049
Cites: 2
Cited by:
Related to: 10