# Recurrence a(n) = (a(n−1) + a(n−2)) (mod 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:96535
- Collection: OEIS
- Page: https://qed.bot/s/oeis-96535
- 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/96535.lean

## AI claims

No AI contribution is recorded against this statement.

## Formal statements

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

Cite as: qed.bot, "Recurrence a(n) = (a(n−1) + a(n−2)) (mod n)", https://qed.bot/s/oeis-96535, as of 30 Sep 2026. The register's data is published under CC BY 4.0: https://creativecommons.org/licenses/by/4.0/