lean_workbook_plus_74463

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Disproved status carries no information about that problem. Do not import this node or use it as a dependency.

Find the explicit formula of the sequence $\left\{A_n\right\}$ such that $A_1=a, A_2=a+1, A_{m+1}=mA_{m-1}+A_m(m>1)$ for a given number $a$.

Why this node was retired

The posted statement is

theorem lean_workbook_plus_74463 (a : ℕ) (A : ℕ → ℕ) (hA : A 1 = a ∧ A 2 = a + 1 ∧ ∀ m > 1, A (m + 1) = m * A (m - 1) + A m) : ∀ n, A n = a * (n - 1) + 1   :=  by sorry

The inserted linear formula fails the initial terms and the variable-coefficient recurrence; index0 is also unconstrained.

The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.

Proposed corrected statement

Restore the original mathematical task without the inserted answer: Find the explicit formula of the sequence $\left\{A_n\right\}$ such that $A_1=a, A_2=a+1, A_{m+1}=mA_{m-1}+A_m(m>1)$ for a given number $a$. Require both necessity and sufficiency for a find-all/classification task; no replacement fixed answer is asserted in this audit.

Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.