DEFINITION: A recurrence relation for the sequence {an} is an equation

that expresses ‘an’ in terms of one or more of the previous terms of the
sequence, namely, a0,a1,...,an−1, for all integers n with n ≥ n0, where n0 is a
non-negative integer.
Or more generally, a recurrence relation is a relation between the terms
of a sequence.
A sequence is called a solution of a recurrence relation if its terms satisfy
the recurrence relation.
Example:
Recurrence Relations and
Applications of Recurrence Relations (Modelling with Recurrence
Relations)

EXAMPLE: Rabbits and the Fibonacci Numbers

Consider this problem, which was originally posed by Leonardo Pisano,
also known as Fibonacci, in the thirteenth century in his book Liber abaci.
A young pair of rabbits (one of each gender) is placed on an island. A pair
of rabbits does not breed until they are 2 months old. After they are 2
months old, each pair of rabbits produces another pair each month. Find
a recurrence relation for the number of pairs of rabbits on the island
after ‘n’ months, assuming that no rabbits ever die.
Month Breeding Pairs Young Pair Total Pair
Example: Suppose that a person deposit $10,000 in a savings account at a
bank yielding 11% per year with interest compounded annually. How
much amount will be there in the account after 30 years?
https://www.mathsisfun.com/games/towerofhanoi.html
Degree = The highest subscript - The lowest subscript

We say a recurrence relation is linear if all the sequence terms aj’s exist in
degree exactly one and are not multiplied together except possibly with
some other function of ‘n’ or with some non-zero constant.

We say a recurrence relation is homogeneous if except the sequence

terms aj’s (or multiples of the aj’s) no other function of ‘n’ or a non-zero
constant exists separately in the recurrence relation.
We say a recurrence relation is with constant coefficients if all the
coefficients of the terms of the sequence are all constants, rather than
functions that depend on ‘n’.
Rule-1: If the roots of the characteristic Equation are real numbers but
distinct say 𝑟1 , 𝑟2 , 𝑟3 ,…………… 𝑟𝑘 then the solution of the given Linear
Homogeneous Recurrence Relation is written as:
𝑎𝑛 = 𝛼1 𝑟1𝑛 + 𝛼2 𝑟2𝑛 + 𝛼3 𝑟3𝑛 + ⋯ … … … … … … … . . + 𝛼𝑘 𝑟𝑘𝑛
Rule-2: If the roots of the characteristic Equation are real numbers but
repeated (same) say 𝑟1 , 𝑟1 , 𝑟2 , 𝑟2 , 𝑟2 …………… then the solution of the
given Linear Homogeneous Recurrence Relation is written as:
𝑎𝑛 = (𝛼1 + 𝑛𝛼2 )𝑟1𝑛 + (𝛼3 + 𝑛𝛼4 + 𝑛2 𝛼5 )𝑟2𝑛 + … … … … … … … … ..
Example: Solve the recurrence relation: 𝑎𝑛 = 𝑎𝑛−1 + 2𝑎𝑛−2 along with
the initial conditions 𝑎0 = 2, 𝑎1 = 7.
Example: Solve the recurrence relation: 𝑎𝑛 = 6𝑎𝑛−1 − 9𝑎𝑛−2 along
with the initial conditions 𝑎0 = 1, 𝑎1 = 5.
Example: Solve the recurrence relation:
9𝑎𝑛 − 15𝑎𝑛−1 − 32𝑎𝑛−2 − 12𝑎𝑛−3 = 0.
https://www.symbolab.com/solver/roots-
calculator/roots%20x%5E%7B3%7D%2B8

Example: Solve the recurrence relation:

𝑎𝑛 = 6𝑎𝑛−1 − 11𝑎𝑛−2 + 6𝑎𝑛−3 along with the initial conditions
𝑎0 = 2, 𝑎1 = 5, 𝑎2 = 15.
Example: Solve the recurrence relation:
𝑎𝑛 = −3𝑎𝑛−1 − 3𝑎𝑛−2 − 𝑎𝑛−3 along with the initial conditions
𝑎0 = 1, 𝑎1 = −2, 𝑎2 = −1.
Example: Solve the recurrence relation:
27𝑎𝑛 − 54𝑎𝑛−1 + 36𝑎𝑛−2 − 8𝑎𝑛−3 = 0.
Example: Solve the recurrence relation:
𝑎𝑛 + 2𝑎𝑛−1 + 3𝑎𝑛−2 + 2𝑎𝑛−3 + 𝑎𝑛−4 = 0.
Rule-3: If the roots of the characteristic Equation are complex numbers
but distinct say a±𝑖𝑏, 𝑐 ± 𝑖𝑑,…………………………
then the solution of the given Linear Homogeneous Recurrence Relation is
written as
𝑎𝑛 = 𝑟1𝑛 (𝛼1 𝑐𝑜𝑠𝑛𝜃1 + 𝛼2 𝑠𝑖𝑛𝑛𝜃1 ) + 𝑟2𝑛 (𝛼3 𝑐𝑜𝑠𝑛𝜃2 + 𝛼4 𝑠𝑖𝑛𝑛𝜃2 )
+ … … … … … … … … ..
𝑏 𝑏
where 𝑟1 = √𝑎2 + 𝑏2 and 𝑡𝑎𝑛𝜃1 = 𝑜𝑟 𝜃1 = 𝑡𝑎𝑛−1 ( )
𝑎 𝑎

𝑑 𝑑
𝑎𝑛𝑑 𝑟2 = √𝑐 2 + 𝑑 2 and 𝑡𝑎𝑛𝜃2 = 𝑜𝑟 𝜃2 = 𝑡𝑎𝑛−1 ( 𝑐 )
𝑐

and so on
𝑏
(Remark: If in 𝑎 ± 𝑖𝑏, “a” is negative then 𝜃1 = 𝜋 − 𝑡𝑎𝑛−1 |𝑎|)

Example: Solve the recurrence relation: 𝑦𝑘+2 − 2𝑦𝑘+1 + 2𝑦𝑘 = 0 along

with the initial conditions 𝑦0 = 0, 𝑦1 = −1.

Example: Solve the recurrence relation: 𝑦𝑘+2 + 2𝑦𝑘+1 + 2𝑦𝑘 = 0 along

with the initial conditions 𝑦0 = 0, 𝑦1 = −1.
Rule-4: If the roots of the characteristic Equation are complex
numbers but repeated (same) say 𝑎 ± 𝑖𝑏, 𝑎 ± 𝑖𝑏, 𝑐 ±
𝑖𝑑, … … … … … ….then the solution of the given Linear Homogeneous
Recurrence Relation is written as
𝑎𝑛 = 𝑟1𝑛 [(𝛼1 + 𝑛𝛼2 )𝑐𝑜𝑠𝑛𝜃1 + (𝛼3 + 𝑛𝛼4 )𝑠𝑖𝑛𝑛𝜃1 ] + 𝑟2𝑛 (𝛼5 𝑐𝑜𝑠𝑛𝜃2 +
𝛼6 𝑠𝑖𝑛𝑛𝜃2 ) + … … … … … … … … ..
𝑏
where 𝑟1 = √𝑎2 + 𝑏2 and 𝑡𝑎𝑛𝜃1 = 𝑎 𝑎𝑛𝑑 𝑟2 = √𝑐 2 + 𝑑 2 and
𝑑
𝑡𝑎𝑛𝜃2 = 𝑐
and so on
𝑏
(Remark: If in 𝑎 ± 𝑖𝑏, “a” is negative then 𝜃1 = 𝜋 − 𝑡𝑎𝑛−1 |𝑎|)

Example: Solve the recurrence relation: 𝑎𝑛 + 8𝑎𝑛−2 + 16𝑎𝑛−4 = 0.

Example: Solve the recurrence relation: 𝑎𝑛 + 18𝑎𝑛−2 + 81𝑎𝑛−4 = 0.

Example: Solve the recurrence relation: 𝑎𝑛 = −8𝑎𝑛−3 .

Example: Solve the recurrence relation: 𝑎𝑛 + 16𝑎𝑛−4 = 0.
Example: Solve the recurrence relation: 𝑎𝑛 + 81𝑎𝑛−4 = 0.
Example: Solve the recurrence relation: 𝑎𝑛 + 𝑘 4 𝑎𝑛−4 = 0where k is
real number.
Example: Solve the recurrence relation: 𝑎𝑛 − 81𝑎𝑛−4 = 0.
Example: Solve the recurrence relation: 𝑎𝑛 − 16𝑎𝑛−4 = 0.
Example: Solve the recurrence relation: 𝑎𝑛 − 𝑘 4 𝑎𝑛−4 = 0where k is
real number.
Q. If ℎ = 1 and 𝑛 > 𝑚 then Δ𝑛 𝑥 (𝑚) =?
(a) 0 (b) 𝑚! (c) (𝑚 − 1)! (d) None of these.
Q. If ℎ = 1 and 𝑛 = 𝑚 then Δ𝑛 𝑥 (𝑚) =?
(a) 0 (b) 𝑚! (c) (𝑚 − 1)! (d) None of these.

To express a polynomial in terms of Factorial Notation.

4𝑘 3 − 3𝑘 2 + 4𝑘 + 7 = 4𝑘 (3) + 9𝑘 (2) + 5𝑘 (1) + 7
To express a polynomial in terms of Factorial Notation.
3𝑘 2 + 2𝑘 + 4 = 𝑎𝑘 (2) + 𝑏𝑘 (1) + 𝑐
Solving Linear Non-Homogeneous Recurrence Relation with Constant
Coefficients
The most general Linear Non-Homogeneous Recurrence Relation with Constant Coefficients is given by
𝑎𝑛 = 𝑐1 𝑎𝑛−1 + 𝑐2 𝑎𝑛−2 + 𝑐3 𝑎𝑛−3 + ⋯ … … … … . +𝑐𝑘 𝑎𝑛−𝑘 + 𝑓(𝑛) where

𝛽𝑛 𝑖. 𝑒. 𝑓(𝑛) 𝑖𝑠 𝑎𝑛 𝑒𝑥𝑝𝑜𝑛𝑒𝑡𝑖𝑎𝑙 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝑛

𝑐𝑜𝑠𝛽𝑛 𝑜𝑟 𝑠𝑖𝑛𝛽𝑛 𝑖. 𝑒. 𝑓(𝑛) 𝑖𝑠 𝑡𝑟𝑖𝑔𝑜𝑛𝑜𝑚𝑒𝑡𝑟𝑖𝑐 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝑛
𝑘 𝑘−1
𝑓(𝑛) = 𝛼1 𝑛 + 𝛼2 𝑛 + 𝛼3 𝑛𝑘−2 + ⋯ … … … … . +𝛼𝑘+1 𝑖. 𝑒. 𝑓(𝑛) 𝑖𝑠 𝑎𝑛 𝑎𝑙𝑔𝑒𝑏𝑟𝑎𝑖𝑐 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝑛
𝑐𝑜𝑠𝛼𝑛 𝑜𝑟 𝑠𝑖𝑛𝛼𝑛
𝛽 𝑛 𝐹(𝑛) 𝐹(𝑛) = {
{ 𝛼1 𝑛𝑘 + 𝛼2 𝑛𝑘−1 + 𝛼3 𝑛𝑘−2 + ⋯ … … … … . +𝛼𝑘+1

(ℎ) (𝑝)
In this case the general solution is given by 𝑎𝑛 = 𝑎𝑛 + 𝑎𝑛 where
(ℎ)
𝑎𝑛 is the solution of the corresponding Linear Homogeneous
(𝑝)
Recurrence Relation with Constant Coefficients and 𝑎𝑛 is the
particular solution.

Example: Solve the recurrence relation:

𝑦𝑘+1 + 3𝑦𝑘−1 − 4𝑦𝑘 = 5𝑘
( ) 1 1
Case: 1 If 𝑓(𝑛) = 𝛽 𝑛 then 𝑎𝑛𝑝 = 𝜙(𝐸) 𝛽 𝑛 = 𝜙(𝛽) 𝛽 𝑛 provided 𝜙(𝛽 ) ≠ 0.
If 𝜙(𝛽 ) = 0 then if the recurrence relation is:
( ) 1
(a) (𝐸 − 𝛽 )𝑎𝑛 = 𝛽 𝑛 then 𝑎𝑛𝑝 = (𝐸−𝛽) 𝛽 𝑛 = 𝑛𝛽 𝑛−1
( ) 1 𝑛(𝑛−1)
(b) (𝐸 − 𝛽 )2 𝑎𝑛 = 𝛽 𝑛 then 𝑎𝑛𝑝 = (𝐸−𝛽)2 𝛽 𝑛 = 2!
𝛽 𝑛−2
( ) 1 𝑛(𝑛−1)(𝑛−2) 𝑛−3
(c) (𝐸 − 𝛽 )3 𝑎𝑛 = 𝛽 𝑛 then 𝑎𝑛𝑝 = (𝐸−𝛽)3 𝛽 𝑛 = 3!
𝛽

And so on.

( ) 1 1
Case: 1 If 𝑓(𝑛) = 𝛽 𝑛 then 𝑎𝑛𝑝 = 𝜙(𝐸) 𝛽 𝑛 = 𝜙(𝛽) 𝛽 𝑛 provided 𝜙(𝛽 ) ≠ 0.

Q. Which of the following is the particular solution of the recurrence

relation?
𝑦𝑘+1 + 3𝑦𝑘−1 − 4𝑦𝑘 = 5𝑘
5𝑘 5𝑘+1 5𝑘−1
(a) 8
(b) 8
(c) 8
(d) None of these.
Example: Solve the recurrence relation:
𝑢𝑛+2 + 4𝑢𝑛 − 3𝑢𝑛+1 = 5𝑛
Q. Which of the following is the particular solution of the recurrence
relation?
𝑎𝑛 = −3𝑎𝑛−1 − 3𝑎𝑛−2 − 𝑎𝑛−3 + 3(−1)n .
 𝑛(𝑛−1)(𝑛−2)(−1)𝑛 𝑛(𝑛−1)(𝑛−2)(−1)𝑛
(a) 2
(b) 6
𝑛(𝑛−1)(−1)𝑛
(c) 2
(d) None of these.

Example: Solve the recurrence relation:

27𝑎𝑛 − 54𝑎𝑛−1 + 36𝑎𝑛−2 − 8𝑎𝑛−3 = 5(2n 3−n ).
Example: Solve the recurrence relation:
9𝑎𝑛 − 15𝑎𝑛−1 − 32𝑎𝑛−2 − 12𝑎𝑛−3 = π(−1)n 2𝑛 3−n .
(9𝐸 2 + 12𝐸 + 4)−1 [𝜋(−2)𝑛 (3)−𝑛 ] =?
Q. Which of the following is the solution of the corresponding
homogeneous recurrence relation?
4𝑎𝑛 − 𝑎𝑛−1 = 3n2 − 4𝑛 + 5
(a) 𝑐1 4𝑛 (b) 𝑐1 4−𝑛 (c) 𝑐1 (−4)𝑛 (d) None of these.
Case-II: If 𝑓(𝑛) is a polynomial function of ‘𝑛’ then we express 𝜙(𝐸 ) as
1
𝐹 (Δ) using 𝐸 ≡ 1 + Δ and expand 𝐹(Δ) in ascending powers of Δ using
Binomial Theorem.
 𝑛(𝑛 − 1) 2 𝑛(𝑛 − 1)(𝑛 − 2) 3
(1 + 𝑥 )𝑛 = 1 + 𝑛𝑥 + 𝑥 + 𝑥 + ⋯……………
2! 3!
(1 + 𝑥 )−1 = 1 − 𝑥 + 𝑥 2 − 𝑥 3 + 𝑥 4 − ⋯ … … … …
(1 − 𝑥 )−1 = 1 + 𝑥 + 𝑥 2 + 𝑥 3 + 𝑥 4 − ⋯ … … … …
(1 + 𝑥 )−2 = 1 − 2𝑥 + 3𝑥 2 − 4𝑥 3 + 5𝑥 4 − ⋯ … … … …
(1 − 𝑥 )−2 = 1 + 2𝑥 + 3𝑥 2 + 4𝑥 3 + 5𝑥 4 + ⋯ … … … …

Example: Solve the recurrence relation:

4𝑎𝑛 − 𝑎𝑛−1 = 3n2 − 4𝑛 + 5

Example: Solve the recurrence relation:

4𝑦𝑘+2 − 20𝑦𝑘+1 + 25𝑦𝑘 = 𝑘 2 .
Example: Solve the recurrence relation:
𝑦𝑘+1 − 8𝑦𝑘 + 41𝑦𝑘−1 = 3𝑘 2 − 4𝑘 + 5.
Example: Solve the difference equation:
4Δ2 𝑎𝑛 − 4Δ𝑎𝑛 + 𝑎𝑛 = 𝜋.
Example: Solve the difference equation:
4Δ2 𝑎𝑛 − 4Δ𝑎𝑛 + 𝑎𝑛 = (−2)−3𝑛+4 .
Q. Which of the following is the solution of the corresponding
homogeneous recurrence relation?
(2Δ − 1)−2 (𝜋) =?
(a) 2𝜋 (b) 𝜋 (c) 𝜋/2 (d) None of these.
1 (𝑚 ) 𝑛(𝑚+1) 1 (𝑚 ) 𝑛(𝑚+2)
Formula: (𝑛 )= , (𝑛 ) = (𝑚+1)(𝑚+2) and so on.
Δ 𝑚+1 Δ2

Example: Solve the recurrence relation:

−3𝑎𝑛+2 + 8an+1 − 5𝑎𝑛 = 2n2 − 3𝑛 + 4.
Q. If ℎ = 1 then Δ16 [𝑥 14 − 2𝑥 13 + 3𝑥 (15) ] =?
(a) 0 (b) 1 (c) 15! (d) None of these.
Q. If ℎ = 1 then Δ16 [𝑥 14 − 2𝑥 13 + 3𝑥 (16) ] =?
(a) 0 (b) 1 (c) 15! (d) None of these.
Case-III: If 𝑓(𝑛) is 𝑐𝑜𝑠𝛽𝑛 or 𝑠𝑖𝑛𝛽𝑛 then we express
(𝑒 𝑖𝛽𝑛 +𝑒 −𝑖𝛽𝑛 ) (𝑒 𝑖𝛽𝑛 −𝑒 −𝑖𝛽𝑛 )
𝑐𝑜𝑠𝛽𝑛 = And 𝑠𝑖𝑛𝛽𝑛 = and proceed as per the
2 2𝑖
Case-I.
Remark: If 𝑓(𝑛) is cosh(𝛽𝑛) or sinh(𝛽𝑛) then we express
(𝑒 𝛽𝑛 +𝑒 −𝛽𝑛 ) (𝑒 𝛽𝑛 −𝑒 −𝛽𝑛 )
cosh(𝛽𝑛) = And sinh(𝛽𝑛) = and proceed as per
2 2
the Case-I.
Example: Solve the recurrence relation: 𝑎𝑛+2 = −5𝑎𝑛 + cos4n.

Case-IV: If 𝑓(𝑛) = 𝛽 𝑛 𝐹(𝑛)

𝑐𝑜𝑠𝛼𝑛 𝑜𝑟 𝑠𝑖𝑛𝛼𝑛
𝑤ℎ𝑒𝑟𝑒 𝐹 (𝑛) = { then
𝛼1 𝑛𝑘 + 𝛼2 𝑛𝑘−1 + 𝛼3 𝑛𝑘−2 + ⋯ … … … … . +𝛼𝑘+1
(𝑝 ) 1 1
𝑎𝑛 = 𝜙(𝐸) 𝛽 𝑛 𝐹 (𝑛) = 𝛽 𝑛 𝜙(𝛽𝐸) 𝐹 (𝑛) And proceed as per the Case-II or
Case-III.

Example: Solve the recurrence relation:

(E 2 − 𝐸 + 56)𝑎𝑛 = 2𝑛 (𝑛2 − 3).
Definition: Let {𝑎𝑘 }∞
𝑘=0 = {𝑎0 , 𝑎1 , 𝑎2 , 𝑎3 , … … . . } be a sequence of real
numbers. Then the generating function of the given sequence is defined
as
𝐺 (𝑥 ) = 𝑎0 𝑥 0 + 𝑎1 𝑥 1 + 𝑎2 𝑥 2 + 𝑎3 𝑥 3 + ⋯ … … … ….

Or 𝐺 (𝑥 ) = ∑∞
𝑘=0 𝑎𝑘 𝑥
𝑘
 1 1 1
Q. What is the generating function of the sequence: {1,1, 2! , 3! , 4! , … … . }
Or
1 ∞
Q. What is the generating function of the sequence: {𝑛!}
𝑛=0
Or
1 ∞
Q. What is the generating function of the sequence: {𝑘!}
𝑘=0

Q. What is the generating function of the sequence: {1𝑘 }∞

𝑘=0

Sequence {𝑎𝑘 }∞
𝑘=0 Generating Function G(x)

{1𝑘 }∞ 1
𝑘=0 = (1 − 𝑥 )−1
(1 − 𝑥)

1 ∞ 𝑒𝑥
{ }
𝑘! 𝑘=0

{𝛼 𝑘 }∞ 1
𝑘=0 = (1 − 𝛼𝑥 )−1
(1 − 𝛼𝑥 )

{𝐶(𝑚, 𝑘)}∞
𝑘=0 {1 + 𝑥 }𝑚

{𝑘 + 1}∞
𝑘=0
1
2
= (1 − 𝑥 )−2
(1 − 𝑥 )

Q. What is the generating function of the finite sequence: {1,1,1,1}

Example: Solve the recurrence relation:
𝑦𝑘+1 + 3𝑦𝑘−1 − 4𝑦𝑘 = 5𝑘 with 𝑦0 = 1, 𝑦1 = 2.
Remark: If we solve the given recurrence relation by operator method then
9 3𝑘+1 5𝑘+1
then the solution is 𝑦𝑘 = 8 − 4
+
8
.
𝐺(𝑥)−𝑎0 −𝑎1 𝑥 𝐺(𝑥)−𝑎0
Shortcut: Replace 𝑦𝑘+2 → 𝑥2
, 𝑦𝑘+1 →
𝑥
, 𝑦𝑘 → 𝐺(𝑥)
5𝑘+1
𝑦𝑘 = 𝑐1 + 𝑐2 (3𝑘 ) +
8
50+1
1 = 𝑦0 = 𝑐1 + 𝑐2 (30 ) + … … … . . (∗)
8
51+1
2 = 𝑦1 = 𝑐1 + 𝑐2 (31 ) + … … … . . (∗∗)
8
9 3
Solving above two equations we get: 𝑐1 = 8 , 𝑐2 = − 4.

5𝑥 2 2𝑥−1
𝐺 (𝑥 ) = −
(1−5𝑥)(3𝑥−1)(𝑥−1) (3𝑥−1)(𝑥−1)

5𝑥 2 5 5 5
Now (1−5𝑥)(3𝑥−1)(𝑥−1)
=
4(3𝑥−1)
−
8(5𝑥−1)
−
8(𝑥−1)
2𝑥−1 1 1
And (3𝑥−1)(𝑥−1)
=
2(3𝑥−1)
+
2(𝑥−1)

5𝑥 2 2𝑥−1
So 𝐺 (𝑥 ) = (1−5𝑥)(3𝑥−1)(𝑥−1) − (3𝑥−1)(𝑥−1)
3 5 9
𝐺 (𝑥 ) = − −
4(3𝑥−1) 8(5𝑥−1) 8(𝑥−1)
−3 5 9
𝐺 (𝑥 ) = + +
4(1−3𝑥) 8(1−5𝑥) 8(1−𝑥)

Example: Solve the recurrence relation:

𝑎𝑛+1 − 2𝑎𝑛 = 0 with 𝑎0 = 1.
Remark: If we solve the given recurrence relation by operator method
then then the solution is 𝑎𝑛 = 2𝑛 .

Example: Solve the recurrence relation:

𝑎𝑛 = 4𝑎𝑛−1 + 5𝑛−1 with 𝑎1 = 2.
Remark: If we solve the given recurrence relation by operator method
3
then then the solution is 𝑎𝑛 = (− 4) 4𝑛 + 5𝑛 .
Example: What is the generating function of the recurrence relation:
𝑎𝑛+2 = 3𝑎𝑛+1 − 2𝑎𝑛 with 𝑎0 = 0, 𝑎1 = 1.
𝐺 (𝑥 )−𝑎0 −𝑎1 𝑥 𝐺 (𝑥)−𝑎0
Shortcut: 𝑎𝑛+2 → 𝑥2
, 𝑎𝑛+1 → 𝑥
, 𝑎𝑛 → 𝐺(𝑥)

Example: Solve the recurrence relation:

𝑎𝑘 = 3𝑎𝑘−1 for 𝑘 = 1,2,3, … … …. And initial condition 𝑎0 = 2.
𝑎𝑘 = 2(3𝑘 ).
Example: Solve the recurrence relation:
𝑎𝑛 = 8𝑎𝑛−1 + 10𝑛−1 with 𝑎1 = 9.
1
𝑎𝑛 = 2 (8𝑛 + 10𝑛 ).
discrete.openmathbooks.org/dmoi2/section-27.html
Generating Functions (openmathbooks.org)
𝑦𝑘 = 1 + 2−1−𝑘
Q. What is the generating function of the sequence:
{1,11,111,1111, , … … . }
Q. What is the generating function of the sequence: {2,4,10,28, … … . }?