Smallest $m > 0$ such that there are no primes between $nm$ and $n(m+1)$ inclusive.

formal-conjectures · oeis · ams-11

Sierpinski's conjecture (1958) is precisely that a(n) >= n for all n.

Sierpinski's conjecture (1958) is precisely that $a(n) >= n$ for all $n$.

Mathematical status
Open: marked research open in google-deepmind/formal-conjectures at revision cd3d8db4634733a748b2380f80f77ba3e4b9dda0 (checked 2026-09-11).

Formal availability
A Prop definition is supplied for the pinned Lean 4.33.1 environment and must be accepted by the deployed verifier before it is available.

Sources and provenance
Upstream reference cited by formal-conjectures (checked 2026-09-11): https://oeis.org/A110835
Formal statement provenance (Apache-2.0) (checked 2026-09-11): https://github.com/google-deepmind/formal-conjectures/blob/cd3d8db4634733a748b2380f80f77ba3e4b9dda0/FormalConjectures/OEIS/110835.lean
Local target: Corpus.OEIS110835.conjecture
Source SHA-256: 004178e00ac8b2fe8bef819d7cec974e8535da3ac429a142424506aa555bb6a1
Lean v4.33.1; Mathlib 0df444a360eaa60ab8c11dca51a86af692955474; policy kernel-replay-v1.
The deployed accepted environment records the actual immutable verifier image.

Research discussions are not verified proofs. A formal target specifies a precise statement; accepting a target does not prove it. Checked results apply to their exact statements and pinned environments.

Public JSON record