Erdős Problem 342 #
References:
- erdosproblems.com/342
- Ben Green's Open Problem 7
- OEIS A002858
- [Gu04] Guy, Richard K., Unsolved problems in number theory (2004), xviii+437.
IsUlamSequence a means that $a$ is the Ulam sequence (OEIS A002858):
$a(0) = 1$, $a(1) = 2$, and for each $n \geq 2$, $a(n)$ is the least integer
greater than $a(n-1)$ that has a unique representation as $a(i) + a(j)$
with $i < j < n$.
Equations
- One or more equations did not get rendered due to their size.
Instances For
$a(0) = 1$ by definition.
$a(1) = 2$ by definition.
$a(2) = 3$: the only pair $(i,j)$ with $i < j < 2$ is $(0,1)$, giving $1 + 2 = 3$.
$a(3) = 4$: among sums $> 3$ with a unique representation from $\{1,2,3\}$, the smallest is $4 = 1 + 3$. The candidate $5 = 2 + 3$ is ruled out by minimality since $4$ has a unique representation.
Part (iii), is the density of the sequence 0?