# Number of primes of the form 2ⁿ ± 2^k ± 1 with 0 ≤ k < n

A statement in qed.bot, the register of claims of AI work in mathematics. The register grades the evidence attached to each claim; it never rules on whether a proof is correct.

- Identifier: oeis:196697
- Collection: OEIS
- Page: https://qed.bot/s/oeis-196697
- Formal record: open
- Machine-checked: no independent check has verified it
- Fidelity F0: Absent. No formal statement is attached to the result.
- Source: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/OEIS/196697.lean

## AI claims

No AI contribution is recorded against this statement.

## Formal statements

- FormalConjectures/OEIS/196697.lean, https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/OEIS/196697.lean

Cite as: qed.bot, "Number of primes of the form 2ⁿ ± 2^k ± 1 with 0 ≤ k < n", https://qed.bot/s/oeis-196697, as of 20 Nov 2026. The register's data is published under CC BY 4.0: https://creativecommons.org/licenses/by/4.0/
