Erdős Problem #271 — Growth of Stanley sequences
Let be a positive integer. Define the increasing sequence by and . For each , choose the least integer greater than whose addition preserves the absence of three-term arithmetic progressions: Erdős Problem #271 On the Growth of the Counting Function of Stanley Sequences
Here a three-term arithmetic progression consists of three distinct integers with . The question is whether the terms can be determined explicitly and how they grow as . The condition makes explicit the increasing-order requirement in the definition. Erdős Problem #271
Background
This greedy construction is a Stanley sequence: one starts from a finite set with no three-term arithmetic progression and repeatedly adjoins the least larger integer that preserves this property. Odlyzko and Stanley introduced these sequences; Erdős and collaborators later studied them and posed questions about their growth. The initial pair is a simple family of starting sets within this broader construction. On the Growth of the Counting Function of Stanley Sequences
Some starting pairs produce highly structured sequences. For , consists exactly of the nonnegative integers whose base- expansions contain no digit . Odlyzko and Stanley also found related characterizations for the starting pairs and , where . These examples underlie the contrast between regular, relatively slow-growing sequences and the less understood irregular cases. Erdős Problem #271 On the growth of Stanley sequences
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.