ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Ulam has raised the following problem. Starting with a1=1a_1 = 1, a2=2a_2 = 2, define an+1a_{n+1} for n⩾2n \geqslant 2 to be the least integer exceeding ana_n which can be expressed uniquely as ai+aja_i + a_j, i≠ji \neq j, i,j⩽ni, j \leqslant n. Thus, the sequence begins 1,2,3,4,6,8,11,13,16,18,26,28,…1, 2, 3, 4, 6, 8, 11, 13, 16, 18, 26, 28, \ldots . What can be said about this sequence. In particular, do infinitely many pairs a,a+2a, a+2 occur? Does this sequence (eventually) have periodic differences? Is the density 0?

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.