Dual View Random Solved Random Open
OPEN This is open, and cannot be resolved with a finite computation.
With $a_1=1$ and $a_2=2$ let $a_{n+1}$ for $n\geq 2$ be the least integer $>a_n$ which can be expressed uniquely as $a_i+a_j$ for $i<j\leq n$.

What can be said about this sequence? Do infinitely many pairs $a,a+2$ occur? Does this sequence eventually have periodic differences? Is the density $0$?
A problem of Ulam. The sequence is\[1,2,3,4,6,8,11,13,16,18,26,28,\ldots\]at OEIS A002858.

See also Problem 7 of Green's open problems list.

This is problem C4 in Guy's collection [Gu04].
Additional thanks to: Desmond Weisenberg
Proof expositions (0)
If you would like to contribute an exposition of a proof related to this problem, please message a moderator or leave your exposition as a comment.

No proof expositions yet.
Comments (18) Proof claims (0)
More information and links
This page was last edited 30 September 2025. (View history) (View the LaTeX source)

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #342, https://www.erdosproblems.com/342, accessed 2026-09-01

From the external database. (You can help update this.)
Formalised statement? Yes
OEIS A002858
Reactions
Open to collaboration None
Currently working on old-bielefelder
Looks difficult old-bielefelder
Looks tractable None
Could be formalisable None
Working on formalising None