Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_01_15_bolan: Bolan proves that for every N some integer between N and 2^(3N+2) is missing from the Hofstadter consecutive-sum sequence, so the sequence omits infinitely many positive integers; a note posted in the site's thread.
2026_01_15_tang: Tang proves that a_n - n is nondecreasing and unbounded, so the sequence omits infinitely many integers, that a_n is at least n + log log n / log 20 minus a constant, and that a_n is at most n^(4175/2506 + epsilon).
Linked from (1)
Graph