Formal target: Corpus.OEIS110835.conjecture

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

Exact formal statement

∀ (n : Nat), GT.gt.{0} n 0 → GE.ge.{0} (Corpus.OEIS110835.a n) n

This target is a formal statement, not a proof of the problem.

Environment availability: available.