Sequences and Recurrence Relations A-level Maths
Revise sequences and recurrence relations for A-level Maths with clear methods, worked examples, common mistakes and exam-style questions with answers.

Sequences and recurrence relations in A-level Maths describe ordered lists of numbers and the rules that generate them. You need to interpret term-to-term and position-to-term rules, calculate terms accurately, classify behaviour and use sequences in mathematical models.
This guide explains the topic step by step, including arithmetic and geometric sequences where they support recurrence work. It also contains worked examples, common mistakes and an embedded exam-style question with a complete answer.
What are sequences and recurrence relations?
A sequence is an ordered list of terms. The notation unu_nun means the term in position nnn, so u1u_1u1 is the first term, u2u_2u2 is the second term and so on.
There are two main ways to define a sequence:
- An explicit formula gives unu_nun directly in terms of nnn.
- A recurrence relation defines each term using one or more earlier terms.
For example,
un=3n+2 u_n=3n+2 un=3n+2is explicit. Any term can be found immediately by substituting its position. By contrast,
un+1=un+3,u1=5 u_{n+1}=u_n+3,\qquad u_1=5 un+1=un+3,u1=5is recursive. To find u4u_4u4, you normally generate u2u_2u2 and u3u_3u3 first.
| Type of definition | Example | Main advantage |
|---|---|---|
| Explicit | un=5(2)n−1u_n=5(2)^{n-1}un=5(2)n−1 | Finds any term directly |
| Recursive | un+1=2unu_{n+1}=2u_nun+1=2un, u1=5u_1=5u1=5 | Shows how one term develops from the previous term |
The starting value is essential. The relation un+1=2unu_{n+1}=2u_nun+1=2un can produce infinitely many different sequences, depending on the value of u1u_1u1.
Indexing and initial conditions
The index tells you which terms a rule applies to. If u1u_1u1 is given and the rule is un+1=f(un)u_{n+1}=f(u_n)un+1=f(un) for n≥1n\geq1n≥1, the recurrence first produces u2u_2u2. A sequence beginning with u0u_0u0 uses different indexing, so its explicit formula may contain nnn rather than n−1n-1n−1.
Some recurrences depend on two previous terms, such as
un+2=un+1+un. u_{n+2}=u_{n+1}+u_n. un+2=un+1+un.This requires two initial values because one starting term is not enough to calculate the next term uniquely. Always identify the first permitted value of nnn and every initial condition before calculating.
Arithmetic and geometric sequences
Arithmetic and geometric sequences are important special cases. They can be expressed using either explicit formulae or recurrence relations.
Arithmetic sequences
An arithmetic sequence has a constant difference ddd between consecutive terms. Its explicit formula is
un=a+(n−1)d, u_n=a+(n-1)d, un=a+(n−1)d,where aaa is the first term.
A recursive definition is
un+1=un+d,u1=a. u_{n+1}=u_n+d,\qquad u_1=a. un+1=un+d,u1=a.For example, 7,11,15,19,…7,11,15,19,\ldots7,11,15,19,… has a=7a=7a=7 and d=4d=4d=4, so
un=7+4(n−1)=4n+3. u_n=7+4(n-1)=4n+3. un=7+4(n−1)=4n+3.Geometric sequences
A geometric sequence has a constant ratio rrr between consecutive terms. Its explicit formula is
un=arn−1. u_n=ar^{n-1}. un=arn−1.A recursive definition is
un+1=run,u1=a. u_{n+1}=ru_n,\qquad u_1=a. un+1=run,u1=a.For the sequence 6,3,1.5,…6,3,1.5,\ldots6,3,1.5,…, the common ratio is r=12r=\frac12r=21. Therefore,
un=6(12)n−1. u_n=6\left(\frac12\right)^{n-1}. un=6(21)n−1.A negative ratio causes signs to alternate. For instance, if r=−12r=-\frac12r=−21, the sequence changes sign while the magnitude of its terms decreases.
How to use a recurrence relation
A recurrence relation must be read carefully. In
un+1=f(un), u_{n+1}=f(u_n), un+1=f(un),replace every occurrence of unu_nun on the right-hand side with the current term. The result is the next term.
Worked example 1: generating terms
A sequence is defined by
u1=3,un+1=2un−1. u_1=3,\qquad u_{n+1}=2u_n-1. u1=3,un+1=2un−1.Find u2u_2u2, u3u_3u3 and u4u_4u4.
Substitute u1=3u_1=3u1=3:
u2=2(3)−1=5. u_2=2(3)-1=5. u2=2(3)−1=5.Now use u2=5u_2=5u2=5:
u3=2(5)−1=9. u_3=2(5)-1=9. u3=2(5)−1=9.Finally,
u4=2(9)−1=17. u_4=2(9)-1=17. u4=2(9)−1=17.The first four terms are therefore
3,5,9,17. 3,5,9,17. 3,5,9,17.Do not repeatedly substitute the initial value. Each calculation must use the term immediately before it.
Worked example 2: a nonlinear recurrence relation
Let
x1=2,xn+1=3xn+4. x_1=2,\qquad x_{n+1}=\sqrt{3x_n+4}. x1=2,xn+1=3xn+4.Then
x2=3(2)+4=10. x_2=\sqrt{3(2)+4}=\sqrt{10}. x2=3(2)+4=10.The next term is
x3=310+4. x_3=\sqrt{3\sqrt{10}+4}. x3=310+4.If decimal answers are required, keep unrounded calculator values between stages. Early rounding can create an inaccurate final term, especially after many iterations.
Increasing, decreasing and periodic sequences
A sequence is increasing if
un+1>un u_{n+1}>u_n un+1>unfor every relevant integer nnn. It is decreasing if
un+1<un. u_{n+1}<u_n. un+1<un.These statements concern consecutive terms throughout the sequence, not just the first few terms. Calculating several terms can suggest a pattern, but it does not prove that the pattern continues indefinitely.
One way to establish behaviour is to examine the sign of
un+1−un. u_{n+1}-u_n. un+1−un.If this expression is positive for all relevant nnn, the sequence is increasing. If it is negative, the sequence is decreasing.
A periodic sequence repeats after a fixed number of terms. For example,
u1=3,un+1=1un u_1=3,\qquad u_{n+1}=\frac{1}{u_n} u1=3,un+1=un1produces
3,13,3,13,… 3,\frac13,3,\frac13,\ldots 3,31,3,31,…This has period 222 because un+2=unu_{n+2}=u_nun+2=un.
Limits and fixed points
Some recurrence relations generate sequences that approach a finite limit. If un→Lu_n\to Lun→L and the recurrence is continuous near the limit, then un+1u_{n+1}un+1 also approaches LLL.
For a recurrence of the form
un+1=f(un), u_{n+1}=f(u_n), un+1=f(un),a possible limit must satisfy the fixed-point equation
L=f(L). L=f(L). L=f(L).Worked example 3: finding a possible limit
Suppose
un+1=12un+6 u_{n+1}=\frac12u_n+6 un+1=21un+6and the sequence converges to LLL. At the limit,
L=12L+6. L=\frac12L+6. L=21L+6.Therefore,
12L=6 \frac12L=6 21L=6and
L=12. L=12. L=12.This calculation finds a possible limit, but solving L=f(L)L=f(L)L=f(L) alone does not prove convergence. A sequence may move away from a fixed point, alternate without settling or fail to be defined for some terms.
For a linear recurrence
un+1=aun+b, u_{n+1}=au_n+b, un+1=aun+b,the fixed point is
L=b1−a,a≠1. L=\frac{b}{1-a},\qquad a\ne1. L=1−ab,a=1.When ∣a∣<1|a|<1∣a∣<1, the distance from the fixed point is multiplied by ∣a∣|a|∣a∣ at each step, so the sequence converges to LLL. If a<0a<0a<0, it approaches from alternating sides.
Converting a linear recurrence into an explicit formula
A first-order linear recurrence of the form
un+1=aun+b u_{n+1}=au_n+b un+1=aun+bcan often be rewritten using its fixed point LLL. Since L=aL+bL=aL+bL=aL+b,
un+1−L=a(un−L). u_{n+1}-L=a(u_n-L). un+1−L=a(un−L).The differences un−Lu_n-Lun−L therefore form a geometric sequence. This gives
un−L=an−1(u1−L), u_n-L=a^{n-1}(u_1-L), un−L=an−1(u1−L),so
un=L+(u1−L)an−1. u_n=L+(u_1-L)a^{n-1}. un=L+(u1−L)an−1.Worked example 4: finding the explicit formula
Consider
u1=5,un+1=0.4un+9. u_1=5,\qquad u_{n+1}=0.4u_n+9. u1=5,un+1=0.4un+9.First find the fixed point:
L=0.4L+9, L=0.4L+9, L=0.4L+9,so 0.6L=90.6L=90.6L=9 and L=15L=15L=15.
Now apply the formula:
un=15+(5−15)(0.4)n−1. u_n=15+(5-15)(0.4)^{n-1}. un=15+(5−15)(0.4)n−1.Therefore,
un=15−10(0.4)n−1. u_n=15-10(0.4)^{n-1}. un=15−10(0.4)n−1.Because (0.4)n−1→0(0.4)^{n-1}\to0(0.4)n−1→0, this formula also shows directly that un→15u_n\to15un→15.
Verifying an explicit formula
If a question asks you to show that a recurrence has a stated explicit formula, checking several terms is not a complete proof. Mathematical induction can verify that the formula works for every permitted positive integer.
For the recurrence
u1=5,un+1=0.4un+9, u_1=5,\qquad u_{n+1}=0.4u_n+9, u1=5,un+1=0.4un+9,suppose un=15−10(0.4)n−1u_n=15-10(0.4)^{n-1}un=15−10(0.4)n−1. Substitution into the recurrence gives
un+1=0.4(15−10(0.4)n−1)+9. u_{n+1}=0.4\left(15-10(0.4)^{n-1}\right)+9. un+1=0.4(15−10(0.4)n−1)+9.Simplifying,
un+1=15−10(0.4)n, u_{n+1}=15-10(0.4)^n, un+1=15−10(0.4)n,which is the stated formula with nnn replaced by n+1n+1n+1. The base case must also be checked:
15−10(0.4)0=5=u1. 15-10(0.4)^0=5=u_1. 15−10(0.4)0=5=u1.The base case and induction step together prove the formula. If formal induction is not requested, deriving the formula from the geometric sequence un−Lu_n-Lun−L is usually shorter, but your algebra must still establish the result for general nnn.
Sequences and recurrence relations exam question
A sequence is defined by
u1=4,un+1=0.6un+8. u_1=4,\qquad u_{n+1}=0.6u_n+8. u1=4,un+1=0.6un+8.(a) Find u2u_2u2 and u3u_3u3.
(b) Given that the sequence converges, find its limit.
(c) Show that
un=20−16(0.6)n−1. u_n=20-16(0.6)^{n-1}. un=20−16(0.6)n−1.(d) Find the smallest value of nnn for which un>19u_n>19un>19.
Answer
For part (a),
u2=0.6(4)+8=10.4, u_2=0.6(4)+8=10.4, u2=0.6(4)+8=10.4,and
u3=0.6(10.4)+8=14.24. u_3=0.6(10.4)+8=14.24. u3=0.6(10.4)+8=14.24.For part (b), let the limit be LLL. Then
L=0.6L+8, L=0.6L+8, L=0.6L+8,so
0.4L=8 0.4L=8 0.4L=8and L=20L=20L=20.
For part (c), the difference from the fixed point is multiplied by 0.60.60.6 each time. Since
u1−20=4−20=−16, u_1-20=4-20=-16, u1−20=4−20=−16,we obtain
un−20=−16(0.6)n−1. u_n-20=-16(0.6)^{n-1}. un−20=−16(0.6)n−1.Hence
un=20−16(0.6)n−1. u_n=20-16(0.6)^{n-1}. un=20−16(0.6)n−1.For part (d), solve
20−16(0.6)n−1>19. 20-16(0.6)^{n-1}>19. 20−16(0.6)n−1>19.This gives
(0.6)n−1<116. (0.6)^{n-1}<\frac1{16}. (0.6)n−1<161.Taking logarithms,
(n−1)log(0.6)<log(116). (n-1)\log(0.6)<\log\left(\frac1{16}\right). (n−1)log(0.6)<log(161).Since log(0.6)\log(0.6)log(0.6) is negative, dividing reverses the inequality:
n−1>log(1/16)log(0.6)≈5.43. n-1>\frac{\log(1/16)}{\log(0.6)}\approx5.43. n−1>log(0.6)log(1/16)≈5.43.Thus n>6.43n>6.43n>6.43, so the smallest integer value is
n=7. \boxed{n=7}. n=7.Try 4 more sequences and recurrence relations exam questions.
Recurrence relations as models
Recurrence relations are useful when a quantity changes in repeated stages. A model such as
Pn+1=0.8Pn+50 P_{n+1}=0.8P_n+50 Pn+1=0.8Pn+50could represent a process in which 80%80\%80% of the current quantity remains before 505050 units are added. The recurrence records both effects in their correct order.
When interpreting a model, state what PnP_nPn and nnn represent, include suitable units and check whether the answer is realistic. A mathematical limit describes the long-term behaviour of the model, but it is meaningful only while the assumptions behind that model remain appropriate.
Common mistakes in exam questions
Confusing unu_nun with un+1u_{n+1}un+1
The term un+1u_{n+1}un+1 is the term after unu_nun. If n=1n=1n=1, then un+1=u2u_{n+1}=u_2un+1=u2, not u1u_1u1.
Omitting the initial term
A recurrence relation does not usually define one unique sequence without an initial value. Always copy both the recurrence relation and the starting condition into your working.
Using the same term repeatedly
After finding u2u_2u2, use it to find u3u_3u3. Do not substitute u1u_1u1 again unless the recurrence specifically requires it.
Treating a fixed point as proof of convergence
The equation L=f(L)L=f(L)L=f(L) identifies possible limits only. If a question says that the sequence converges, you may use the equation directly. If convergence is not given, you may need to justify it using the explicit formula, monotonicity and boundedness, or another valid argument.
Forgetting to reverse a logarithmic inequality
In an inequality involving ana^nan with 0<a<10<a<10<a<1, log(a)\log(a)log(a) is negative. Dividing by it reverses the inequality sign.
Rounding intermediate terms
Store full calculator values and round only the requested final answer. Recurrence calculations can magnify rounding errors over several iterations.
How to revise sequences and recurrence relations
Start by making sure you can distinguish explicit and recursive definitions. You should then practise generating terms, identifying arithmetic and geometric structures, and finding fixed points.
Next, combine these skills in longer questions. A typical exam problem may ask you to calculate terms, find a limit, obtain an explicit formula and solve an inequality involving the term number.
Use the MathsGenie Edexcel sequences and series revision lesson to review the full topic. You can then attempt Edexcel exam-style questions, AQA sequences and series questions or OCR sequences and series questions, depending on your course.
If you are revisiting earlier sequence skills, the GCSE Maths topics by exam board and tier guide can help identify prerequisite material. At A-level, concentrate on clear notation, exact values and explanations that justify the behaviour of a sequence rather than relying only on calculated terms.
Conclusion
For sequences and recurrence relations in A-level Maths, you must understand how terms are defined, move accurately between consecutive terms and recognise arithmetic, geometric, increasing, decreasing and periodic behaviour. Fixed-point equations help find possible limits, while linear recurrences can often be converted into explicit formulae by considering the difference from the fixed point.
Strong exam answers show each substitution, preserve accuracy and distinguish finding a possible limit from proving convergence. After reviewing the methods, use the relevant MathsGenie lesson, practice questions, worked solutions and mark schemes to apply them under exam conditions.
Sources and referenced URLs
- https://mathsgenie.co.uk/a-level/maths/edexcel/a-level-pure-mathematics-3-sequences-and-series
- https://mathsgenie.co.uk/a-level/maths/edexcel/a-level-pure-mathematics-3-sequences-and-series/questions/q23
- https://mathsgenie.co.uk/a-level/maths/edexcel/a-level-pure-mathematics-3-sequences-and-series/questions/q39
- https://mathsgenie.co.uk/a-level/maths/aqa/a-level-pure-mathematics-3-sequences-and-series/questions/q50
- https://mathsgenie.co.uk/a-level/maths/ocr/a-level-pure-mathematics-3-sequences-and-series/questions/q52
- https://mathsgenie.co.uk/blog/gcse-maths-topics-by-exam-board-and-tier



