ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (an)n≥1(a_n)_{n\ge1} be the strictly increasing sequence defined by

a1=1,a2=2,a_1=1,\qquad a_2=2,

and, for k≥3k\ge3, let aka_k be the least integer greater than ak−1a_{k-1} that can be written as a sum of at least two consecutive earlier terms:

ak=∑i=pqaia_k=\sum_{i=p}^{q}a_i

for some 1≤p≤q≤k−11\le p\le q\le k-1 with q−p≥1q-p\ge1. OEIS conjecture. The sequence (an)n≥1(a_n)_{n\ge1} omits infinitely many positive integers. The conjecture concerns the distribution of the classical Hofstadter consecutive-sum sequence, whose asymptotic behavior was previously posed as an open problem. The paper proves this assertion, so the conjecture is now settled.

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.