Corpus.OEIS109909.conjecture
Conjecture: $a(n) > 0$ for $n > 3$.
formal-conjectures · oeis · ams-11
$a(n)$ = number of primes of the form $k(n-k)-1$.
Conjecture: $a(n) > 0$ for $n > 3$.
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/A109909
Formal statement provenance (Apache-2.0) (checked 2026-09-11): https://github.com/google-deepmind/formal-conjectures/blob/cd3d8db4634733a748b2380f80f77ba3e4b9dda0/FormalConjectures/OEIS/109909.lean
Local target: Corpus.OEIS109909.conjecture
Source SHA-256: 5e08a79cf053d0dafcd65cfe1284f325f6b4ab324ebe784e9f2950197ce072f8
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.
Conjecture: $a(n) > 0$ for $n > 3$.
No public records on this page.
No public records on this page.