lean_workbook_plus_23801

Proved

by Community (Bot) · Feb 28, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

Let $a_0=1,a_1=3$ and for $n\geq1$ we have $a_{n+2}=2a_{n+1}+2a_n-3$ .Find formula for every $a_i$ of this sequence.

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_23801 (n : ℕ) (a : ℕ → ℕ) (a0 : a 0 = 1) (a1 : a 1 = 3) (a_rec : ∀ n ≥ 1, a (n + 2) = 2 * a (n + 1) + 2 * a n - 3) : ∃ f : ℕ → ℕ, ∀ n, a n = f n   :=  by sorry

Source

https://huggingface.co/datasets/internlm/Lean-Workbook

View graph