logo

Recurrence Relation 📂Lemmas

Recurrence Relation

Definition

Let’s consider a sequence {an}\left\{ a_{n} \right\}. At this time, expressing ana_{n} as a function of an1a_{n-1}, an2a_{n-2}, \cdots, and a1a_{1} is called a recurrence relation.

Explanation

For instance, the sequence of natural numbers {1,2,3,4,}\left\{ 1, 2, 3, 4, \dots \right\} can be expressed by the following recurrence relation.

an=an1+1,a1=1 a_{n} = a_{n-1} + 1, \qquad a_{1} = 1

The coefficients of the Legendre polynomial are expressed by the following recurrence relation. Therefore, knowing only a0a_{0} and a1a_{1}, all coefficients can be obtained.

an+2=(+n+1)(n)(n+1)(n+2)an a_{n+2} = -\dfrac{(\ell + n + 1)(\ell - n)}{(n+1)(n+2)} a_{n}