lean_workbook_plus_44941

⚠️ 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 for $s_{n}$ using the recurrence relation $s_{n+3} = 2s_{n+2} + s_{n+1}$ with initial conditions $s_{1} = 2$, $s_{2} = 6$, $s_{3} = 14$.

Why this node was retired

The posted statement is

theorem lean_workbook_plus_44941 (s : ℕ → ℕ) (h₁ : s 1 = 2) (h₂ : s 2 = 6) (h₃ : s 3 = 14) (h₄ : ∀ n, s (n + 4) = 2 * s (n + 3) + s (n + 2)) : ∃ a b c : ℕ, ∀ n, s n = a * (2^n) + b * (3^n) + c   :=  by sorry

The source asks for all solutions or a value; the stored theorem supplies an unsupported answer contradicted by an accepted disproof.

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 stated recurrence beginning at n=0 with s₁=2,s₂=6,s₃=14, leave unspecified s₀ separate, and derive the positive-index closed form using characteristic roots 1±√2. Do not constrain it to natural coefficients times 2^n and 3^n.

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.