All open problems
Source labels openChecked July 26, 2026

OEISNumber theory

Smallest number k such that kn + 1 is prime

Conjecture: a(n)=O(log(n)log(log(n)))a(n) = O(\log(n)\log(\log(n))).

Mathematical statement

Conjecture: a(n)=O(log(n)log(log(n)))a(n) = O(\log(n)\log(\log(n))).

Statement source: OEIS statement material

Statement terms: CC-BY-SA-4.0

Attributed source material. Reuse must follow the linked attribution and share-alike terms.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

a_isBigO

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem a_isBigO : (fun n  (a n : )) =O[atTop] (fun n  Real.log n * Real.log (Real.log n)) := by  sorry
Statement source
Formal Conjectures
Lean version
v4.27.0
Placeholder
Present; no proof artifact
Source evidence
Pinned source index
Fidelity review
Community formulation

References