Erdős (Erdos) Problem #423: status in 2026

Erdős Problem #423

Erdős Problem 423 [Er77c, p.71; ErGr80, p.83]: Let a(1) = 1, a(2) = 2, and for k ≥ 3 let a(k) be the least integer greater than a(k-1) that is a sum of at least two consecutive terms of the sequence. What is the asymptotic behaviour of this sequence? It seems likely that a_n = n + o(n).

Status (as of 2026-11-11): Open according to erdosproblems.com (status last updated 2025-08-31).

Current state (tracked automatically)

erdosproblems.com lists Erdős problem #423 as open (status updated 31 August 2025).
Formal Conjectures marks the Lean statement erdos_423 as open.

All tracked facts and sources

Fact	Value	Source
Status of Erdős problem #423 on erdosproblems.com	open 2025-08-31	erdosproblems.com
Formal Conjectures: status of `erdos_423`	research open	Formal Conjectures
Formal Conjectures: research statements in the file	1 open, 5 solved	Formal Conjectures

Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): erdosproblems.com (checked 2026-11-12), Formal Conjectures (checked 2026-11-12). How it works.

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim. A Lean proof is checked against the statement below by the Lean kernel; a curator confirms before the problem counts as resolved.

Try it with your chatbot Submit a claim Follow (RSS)

Cite

@misc{cairn-erdos-423,
  title        = {Erdős Problem #423},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/erdos-423}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Ferdos-423.json)](https://cairn-commons.com/problems/erdos-423)

Claims

Verified

Disputed

Refuted

On the literature board

Nobody has worked on this problem here yet

Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.

Get a task — one click

Your chatbot works on it — 5–10 minutes, in its own tab

Paste its answer here — check it and publish it under your name

What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.

The problem

The question

Erdős Problem 423 [Er77c, p.71; ErGr80, p.83]:

Let $a (1) = 1$ , $a (2) = 2$ , and for $k \geq 3$ let $a (k)$ be the least integer greater than $a (k - 1)$ that is a sum of at least two consecutive terms of the sequence. What is the asymptotic behaviour of this sequence? It seems likely that $a_{n} = n + o (n)$ .

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.ErdosProblems.«423».

theorem erdos_423 :
    ∀ a : ℕ → ℕ, IsHofstadterSeq a →
    (fun n : ℕ => (a n : ℝ) - n) =o[atTop] (fun n : ℕ => (n : ℝ))

What counts as progress

A Lean proof of the pinned statement (or of its negation, for a yes/no question) — checked by the Lean kernel against the upstream statement; a curator confirms before the problem is marked resolved.
Partial results: special cases, weaker bounds, reductions — as verified claims.
Computations and numerical evidence with published code (reproducible).
Literature: the problem may have been solved or partly solved already — check erdosproblems.com/423. Report it as a literature claim.
A precise flaw in the formal statement (a misformalisation) — report it upstream too.

References

erdosproblems.com/423
[Er77c] Erdős, P., Problems and results on combinatorial number theory. III, Number theory day (Proc. Conf., Rockefeller Univ., New York, 1976), 1977, pp. 43–72.
[ErGr80] Erdős, P. and Graham, R., *Old and new problems and results in combinatorial number theory*, Monographies de L'Enseignement Mathématique (1980).
[Cu25] Cushman, A., A Note on the Sum-Product Problem and the Convex Sumset Problem. arXiv:2512.13849 (2025).
[Ta26] Tang, Q., *The Hofstadter consecutive-sum sequence omits infinitely many positive integers*. arXiv:2603.09939 (2026).
[Bolan] Bolan, M., Hofstader–Ulam Sequence, https://github.com/mjtb49/HofstaderUlam/blob/main/HofstaderUlamSequence.pdf
OEIS A005243

Source and licence

Imported from Formal Conjectures (Erdős problems), commit 2f91d251c07f. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.