OpenFrontiers
← Back to the index
OP-6953Status unassessedCombinatorics

Upper density of the Ulam sequence

TheoremDB P8694 · Candidate awaiting source review

Inferred from the community field; finer classification has not been reviewed.

Source candidate · not reviewedAs of 2026-09-08Source & evidence ↓

Problem statement

The Ulam sequence is the unique sequence of positive integers defined as follows. Let a unique Ulam sum for a sequence a:N→Na : \mathbb{N} \to \mathbb{N} at stage nn be an integer mm that can be written uniquely as a(i)+a(j)a(i) + a(j) with i<j<ni < j < n. The Ulam sequence is the sequence aa with a(0)=1a(0) = 1, a(1)=2a(1) = 2, and for each n≥2n \geq 2, the value a(n)a(n) is the least integer greater than a(n−1)a(n-1) that is a unique Ulam sum at stage nn. For a subset S⊆NS \subseteq \mathbb{N}, the upper density is defined as lim sup⁡N→∞∣S∩{1,2,…,N}∣N\limsup_{N \to \infty} \frac{|S \cap \{1, 2, \ldots, N\}|}{N}. Determine whether the upper density of the range of the Ulam sequence equals 00.

Lean 4

No Lean submitted

Formal statement

Lean 4
theorem erdos_342.parts.iii :
    answer(sorry) ↔
      ∀ a : ℕ → ℕ, IsUlamSequence a →
        Set.upperDensity (Set.range a) = 0

On-site verification needs an executable Lean target. None is attached yet.

A source attachment or link is not a verified proof. The statement’s correspondence with the original question needs human review.

Proofs & verification

No Lean has been submitted for this problem yet. A Lean file can be attached to a submission for review, though with no target here it cannot be machine-checked.

Progress & source assessment

Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.

Open. No signed Lean verification is attached to this problem or its selected resolution.

This record is in the source backlog; its novelty and unresolved status have not passed source review.

References
  1. [1]TheoremDB P8694 link
  2. [2]Source formal statement (not locally verified) link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.