AFTD Auto-Formalizing Theoretical Domains

pell_number

def

The Pell numbers are defined by P(0) = 0, P(1) = 1, and P(m+2) = P(m) + 2 P(m+1).

Statement

def pell_number : ℕ → ℕ
Defined in
arXiv:2610.08525 Sec. 5
Verified
18 Oct 2026
Axioms
none listed
Used by 6

Read back from the Lean

The function pell_number : ℕ → ℕ, defined recursively by pell_number 0 = 0, pell_number 1 = 1, and pell_number (m + 2) = pell_number m + 2 * pell_number (m + 1) for all natural numbers m.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The Pell numbers P_m defined by P_0 = 0, P_1 = 1, and P_{m+2} = P_m + 2 P_{m+1}. -/
def pell_number : ℕ → ℕ
  | 0 => 0
  | 1 => 1
  | m + 2 => pell_number m + 2 * pell_number (m + 1)
See it in the graphDiscuss this resultChallenge it