Paperlane

no. 17 · Wednesday 18 November 2026

The Hofstadter Consecutive-Sum Sequence Omits Infinitely Many Positive Integers

Quanyu Tang

math.NT · v3 · 23 pp

Abstract

We study Hofstadter's greedy self-generating sequence, which begins with 1 and 2 and repeatedly chooses the least integer larger than the preceding term that is a sum of at least two consecutive earlier terms. We prove that the excess of its $n$th term over its index is bounded below by a positive constant times $\log\log n$, up to an additive constant, and that the sequence satisfies a polynomial upper bound. In particular, the sequence omits infinitely many positive integers.

comments
23 pages, 1 figure. Published in the Journal of Integer Sequences. This version incorporates the revisions made for publication
journal
Journal of Integer Sequences 29 (2026), Article 26.6.1
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2603.09939 ↗