# Number of decompositions of 2n+1 into 2p+q, where p and q are both odd primes

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:103151
- Collection: OEIS
- Page: https://qed.bot/s/oeis-103151
- 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/103151.lean

## AI claims

No AI contribution is recorded against this statement.

## Formal statements

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

Cite as: qed.bot, "Number of decompositions of 2n+1 into 2p+q, where p and q are both odd primes", https://qed.bot/s/oeis-103151, as of 30 Sep 2026. The register's data is published under CC BY 4.0: https://creativecommons.org/licenses/by/4.0/