lean_workbook_plus_41542

⚠️ 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 closed form of the sequence $(a_n), n\geq1$ defined by $a_1=1,a_2=2$ and $a_{n+2}=2a_{n+1}-a_n+2$ for $n\geq 1$ .

Why this node was retired

The posted statement is

theorem lean_workbook_plus_41542 (a : ℕ → ℕ) (a1 : a 0 = 1) (a2 : a 1 = 2) (a_rec : ∀ n, a (n + 2) = 2 * a (n + 1) - a n + 2) : ∀ n, a n = n ^ 2 - 2 * n + 2   :=  by sorry

The formal statement changes or incorrectly supplies part of the source problem; the accepted note identifies a concrete witness or definitional mechanism.

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

Proposed corrected statement

For the original one-based data prove a_n=n²−2n+2 for n≥1. Alternatively keep the formal zero-based initial data and use a_n=n²+1.

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.