Journal of Integer Sequences, Vol. 29 (2026), Article 26.6.1

The Hofstadter Consecutive-Sum Sequence Omits Infinitely Many Positive Integers


Quanyu Tang
School of Mathematical Sciences
University of Science and Technology of China
Hefei 230026
P. R. China

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 nth 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.


Full version:  pdf,    ps,    latex    


(Concerned with sequence A005243.)


Received May 19 2026; revised versions received May 20 2026; August 8 2026; August 9 2026; August 15 2026. Published in Journal of Integer Sequences, November 16 2026.


Return to Journal of Integer Sequences home page