# Recurrence a(n+1) = 2n(n+1)a(n) − n⁴ a(n−1) and associated polynomials

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:217703
- Collection: OEIS
- Page: https://qed.bot/s/oeis-217703
- Formal record: mixed
- Machine-checked: no independent check has verified it
- Fidelity F2: The statement corpus cites this proof against its own statement.
- Source: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/OEIS/217703.lean

## AI claims

No AI contribution is recorded against this statement.

## Formal statements

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

Cite as: qed.bot, "Recurrence a(n+1) = 2n(n+1)a(n) − n⁴ a(n−1) and associated polynomials", https://qed.bot/s/oeis-217703, as of 20 Nov 2026. The register's data is published under CC BY 4.0: https://creativecommons.org/licenses/by/4.0/
