Free Mathematics Class 9 CBSE notes · practise this chapter with an AI quiz

← All study notes

One Rule Gives You the Hundredth Term; the Other Makes You Walk There

Learn to spot the pattern in a sequence and continue it, write the explicit rule for the nth term, write the recursive rule including the Fibonacci sequence, and convert between the two descriptions.

What are the two different ways to describe a sequence?

Look at 22, 55, 88, 1111, 1414. There are two honest ways to say what is going on.

The recursive way: start at 22 and keep adding 33.

a1=2,an=an−1+3a_1 = 2, \qquad a_n = a_{n-1} + 3

The explicit way: the nnth term is three times nn, less one.

an=3n−1a_n = 3n - 1

Both describe the same list. But ask for the hundredth term and they behave completely differently. The explicit rule gives it at once:

a100=3(100)−1=299a_{100} = 3(100) - 1 = 299

The recursive rule gives it too — after you have worked out the other ninety-nine terms first.

So the explicit rule is the more useful one whenever it exists. Its drawback is that some sequences have no simple explicit rule at all, and the Fibonacci sequence in the third section is the standard example: it is easy to describe recursively and hard to describe explicitly.

This page covers the first part of the CBSE Class 9 Mathematics chapter on sequences — continuing a pattern, writing both kinds of rule, and moving between them.

How do you spot the pattern and write the next three terms?

Write the differences between consecutive terms first. If they are constant, the rule is add the same amount. If they are not, look at the ratios, then at the differences of the differences.

Worked example 1 — constant differences. 22, 55, 88, 1111. Differences: 33, 33, 33. So keep adding 33:

14, 17, 2014, \ 17, \ 20

Worked example 2 — constant ratio. 33, 66, 1212, 2424. Differences 33, 66, 1212 are not constant, but the ratios are 22, 22, 22. So keep doubling:

48, 96, 19248, \ 96, \ 192

Worked example 3 — square numbers. 11, 44, 99, 1616. Differences 33, 55, 77 are not constant, but they grow by 22 each time, so the next differences are 99, 1111, 1313:

25, 36, 4925, \ 36, \ 49

These are 525^2, 626^2, 727^2 — the square numbers.

Worked example 4 — triangular numbers. 11, 33, 66, 1010. Differences 22, 33, 44, increasing by one, so the next differences are 55, 66, 77:

15, 21, 2815, \ 21, \ 28

These count dots stacked in a triangle: one row of 11, then 1+21+2, then 1+2+31+2+3, and so on.

Worked example 5 — each term from the two before it. 11, 11, 22, 33, 55. Differences are 00, 11, 11, 22, which is the sequence itself shifted — a signal to try adding pairs. Indeed 1+1=21+1 = 2, 1+2=31+2 = 3, 2+3=52+3 = 5, so

8, 13, 218, \ 13, \ 21

This is the Fibonacci sequence.

Worked example 6 — an alternating sign. 22, −4-4, 88, −16-16. The ratio is −2-2 each time:

32, −64, 12832, \ -64, \ 128

A finite list never forces a single continuation. After 11, 22, 44 the answer 88 is natural under keep doubling, but 77 is equally defensible under add one more each time. So a complete answer states the rule as well as the terms — the rule is what makes the continuation more than a guess.

Where the structure supplies the certainty. For the triangular numbers the rule is not fitted to the numbers at all; it is a count of dots, and each new row genuinely adds one more dot than the row before. That is the difference between a pattern you have justified and one you have merely matched, and the next sections turn justified patterns into formulas.
Formula

How do you write the explicit rule for the nth term?

For a sequence with constant differences, the difference is the coefficient of nn, and the constant is whatever makes the first term come out right:

an=dn+(a1−d)a_n = dn + (a_1 - d)

For sequences that are not of that kind, recognise the standard families below.

Worked example 1 — constant difference 33. For 22, 55, 88, 1111: d=3d = 3, and a1−d=2−3=−1a_1 - d = 2 - 3 = -1, so

an=3n−1a_n = 3n - 1

Check at n=1n = 1: 22. At n=4n = 4: 1111. Then a20=60−1=59a_{20} = 60 - 1 = 59 and a100=299a_{100} = 299.

Worked example 2 — constant difference 44. For 55, 99, 1313, 1717: d=4d = 4 and a1−d=1a_1 - d = 1, so

an=4n+1a_n = 4n + 1

Check at n=1n = 1: 55. Then a20=81a_{20} = 81.

Worked example 3 — square numbers. For 11, 44, 99, 1616:

an=n2⇒a20=400a_n = n^2 \qquad \Rightarrow \qquad a_{20} = 400

Worked example 4 — triangular numbers. The nnth triangular number is the sum 1+2+⋯+n1 + 2 + \cdots + n, and the closed form is

Tn=n(n+1)2T_n = \frac{n(n+1)}{2}

Check at n=4n = 4: 4×52=10\frac{4 \times 5}{2} = 10. Correct. Then T10=10×112=55T_{10} = \frac{10 \times 11}{2} = 55 and T20=20×212=210T_{20} = \frac{20 \times 21}{2} = 210.

Worked example 5 — a doubling sequence. For 33, 66, 1212, 2424 the ratio is 22, so

an=3×2n−1a_n = 3 \times 2^{n-1}

Check at n=1n = 1: 3×20=33 \times 2^0 = 3. At n=4n = 4: 3×8=243 \times 8 = 24. Then a10=3×512=1536a_{10} = 3 \times 512 = 1536.

Worked example 6 — working backwards from a term. Which term of 22, 55, 88, 1111 equals 5959? Solve 3n−1=593n - 1 = 59:

3n=60⇒n=203n = 60 \qquad \Rightarrow \qquad n = 20

So 5959 is the twentieth term. And is 100100 a term? 3n−1=1003n - 1 = 100 gives 3n=1013n = 101, which is not divisible by 33 — so no.

Always check the rule at a term other than the first. The constant was chosen to make a1a_1 correct, so the first term proves nothing. The second or third term is the real test, and it takes one substitution.

Not every sequence has a workable explicit rule. The Fibonacci sequence does have one, but it involves irrational numbers and is well beyond this stage — so it is described recursively instead, which is the next section.

How do you write a recursive rule and use it for the Fibonacci sequence?

Give the starting term or terms, then a rule that builds each new term from the ones before it. A recursive description always needs both halves.

Worked example 1 — adding a constant. For 22, 55, 88, 1111:

a1=2,an=an−1+3  (n>1)a_1 = 2, \qquad a_n = a_{n-1} + 3 \ \ (n > 1)

Generating: a2=5a_2 = 5, a3=8a_3 = 8, a4=11a_4 = 11, a5=14a_5 = 14. Correct.

Worked example 2 — multiplying by a constant. For 33, 66, 1212, 2424:

a1=3,an=2an−1a_1 = 3, \qquad a_n = 2a_{n-1}

Generating: 33, 66, 1212, 2424, 4848.

Worked example 3 — triangular numbers. Each one adds the next whole number:

T1=1,Tn=Tn−1+nT_1 = 1, \qquad T_n = T_{n-1} + n

Generating: T2=1+2=3T_2 = 1+2 = 3, T3=3+3=6T_3 = 3+3 = 6, T4=6+4=10T_4 = 6+4 = 10, T5=15T_5 = 15. Correct.

Worked example 4 — square numbers. Each square adds the next odd number:

S1=1,Sn=Sn−1+(2n−1)S_1 = 1, \qquad S_n = S_{n-1} + (2n - 1)

Generating: S2=1+3=4S_2 = 1+3 = 4, S3=4+5=9S_3 = 4+5 = 9, S4=9+7=16S_4 = 9+7 = 16. Correct — and this is why 1+3+5+7=161+3+5+7 = 16, a fact the next part of this chapter uses.

Worked example 5 — the Fibonacci sequence. Here each term needs the two before it, so two starting values are required:

F1=1,F2=1,Fn=Fn−1+Fn−2F_1 = 1, \quad F_2 = 1, \qquad F_n = F_{n-1} + F_{n-2}

Generating step by step:

- F3=1+1=2F_3 = 1 + 1 = 2
- F4=1+2=3F_4 = 1 + 2 = 3
- F5=2+3=5F_5 = 2 + 3 = 5
- F6=3+5=8F_6 = 3 + 5 = 8
- F7=5+8=13F_7 = 5 + 8 = 13
- F8=8+13=21F_8 = 8 + 13 = 21
- F9=13+21=34F_9 = 13 + 21 = 34
- F10=21+34=55F_{10} = 21 + 34 = 55

The number of starting values must match how far back the rule reaches. A rule using only an−1a_{n-1} needs one starting value; Fibonacci's rule reaches back two terms, so it needs two. Giving only F1=1F_1 = 1 would leave the sequence undetermined, since F2F_2 could be anything and every later term would change with it.

Worked example 6 — the same rule, different start. Keep Fn=Fn−1+Fn−2F_n = F_{n-1} + F_{n-2} but begin 22, 11:

2, 1, 3, 4, 7, 11, 18, 292, \ 1, \ 3, \ 4, \ 7, \ 11, \ 18, \ 29

A completely different list from the identical rule. So the starting values are part of the description, not preamble to it.

Recursion is how a growing pattern actually behaves. A matchstick row genuinely gains three sticks per square, and a stack of dots genuinely gains one more row — the recursive rule states the mechanism. The explicit rule is the shortcut derived from it, which is why converting between them is worth being able to do in both directions.

How do you convert between the explicit and recursive descriptions?

Explicit to recursive: find the difference between consecutive terms. Recursive to explicit: identify the constant difference and fit the constant.

Worked example 1 — explicit to recursive. Given an=3n−1a_n = 3n - 1, compute the difference:

an−an−1=(3n−1)−(3(n−1)−1)=3n−1−3n+3+1=3a_n - a_{n-1} = (3n - 1) - (3(n-1) - 1) = 3n - 1 - 3n + 3 + 1 = 3

So the recursive form is an=an−1+3a_n = a_{n-1} + 3, with a1=3(1)−1=2a_1 = 3(1) - 1 = 2.

Worked example 2 — recursive to explicit. Given a1=5a_1 = 5 and an=an−1+4a_n = a_{n-1} + 4, the difference is 44 and the constant is 5−4=15 - 4 = 1:

an=4n+1a_n = 4n + 1

Check at n=1n = 1: 55. At n=3n = 3: 1313, matching 55, 99, 1313.

Worked example 3 — explicit to recursive for the squares. Given Sn=n2S_n = n^2:

Sn−Sn−1=n2−(n−1)2=n2−n2+2n−1=2n−1S_n - S_{n-1} = n^2 - (n-1)^2 = n^2 - n^2 + 2n - 1 = 2n - 1

So Sn=Sn−1+(2n−1)S_n = S_{n-1} + (2n-1) with S1=1S_1 = 1 — the odd numbers, as the previous section found by inspection.

Worked example 4 — explicit to recursive for the triangular numbers. Given Tn=n(n+1)2T_n = \frac{n(n+1)}{2}:

Tn−Tn−1=n(n+1)2−(n−1)n2=n[(n+1)−(n−1)]2=2n2=nT_n - T_{n-1} = \frac{n(n+1)}{2} - \frac{(n-1)n}{2} = \frac{n\left[(n+1)-(n-1)\right]}{2} = \frac{2n}{2} = n

So Tn=Tn−1+nT_n = T_{n-1} + n with T1=1T_1 = 1. Both descriptions confirmed against each other.

Worked example 5 — recognising a family from its rule. A sequence has an=an−1+(2n−1)a_n = a_{n-1} + (2n-1) with a1=1a_1 = 1. The increments are the odd numbers, so the terms are the partial sums of the odds — the square numbers, and the explicit rule is an=n2a_n = n^2.

Another has an=an−1+na_n = a_{n-1} + n with a1=1a_1 = 1. The increments are the whole numbers, so these are the triangular numbers, Tn=n(n+1)2T_n = \frac{n(n+1)}{2}.

Worked example 6 — a relation between the two families. Add two consecutive triangular numbers:

T4+T3=10+6=16=42T_4 + T_3 = 10 + 6 = 16 = 4^2
T5+T4=15+10=25=52T_5 + T_4 = 15 + 10 = 25 = 5^2

So Tn+Tn−1=n2T_n + T_{n-1} = n^2. Check algebraically:

n(n+1)2+(n−1)n2=n[(n+1)+(n−1)]2=2n22=n2\frac{n(n+1)}{2} + \frac{(n-1)n}{2} = \frac{n\left[(n+1)+(n-1)\right]}{2} = \frac{2n^2}{2} = n^2

Two triangles of dots, one turned upside down, fit together into a square — which is the picture that identity draws.

Conversion is only easy in one direction for some sequences. Going explicit to recursive is always a subtraction and always works. Going recursive to explicit requires recognising the pattern of increments, and for Fibonacci no elementary explicit rule exists — the increments are the sequence itself, so there is nothing simpler to sum. That asymmetry is the reason both descriptions are taught, rather than one being treated as the proper form.
Exam tip

Exam tip: write the differences first, then check at a second term

Write the differences under the sequence before anything else. Constant differences mean a linear rule; growing differences mean squares or triangles; constant ratios mean doubling or halving.

If the differences are not constant, take their differences too. For 1,4,9,161, 4, 9, 16 the second differences are all 22 — the signature of n2n^2.

State the rule, not just the next terms. *Add 33 each time* or an=3n−1a_n = 3n - 1 earns the marks; three numbers alone do not.

Check the explicit rule at a term other than the first — the constant was fitted to a1a_1, so a2a_2 or a3a_3 is the real test.

A recursive description needs its starting value. One starting value for a rule using an−1a_{n-1}; two for Fibonacci, which reaches back twice.

Show the generation step by step for a recursive question: F3=2F_3 = 2, F4=3F_4 = 3, F5=5F_5 = 5.

For "which term equals kk", solve the rule as an equation: 3n−1=593n - 1 = 59 gives n=20n = 20. If nn comes out fractional, the value is not a term — say so.

Learn the two standard forms: Tn=n(n+1)2T_n = \frac{n(n+1)}{2} for triangular numbers, Sn=n2S_n = n^2 for squares.

To convert explicit to recursive, subtract an−1a_{n-1} from ana_n and simplify — it is always a short algebra step.

And remember
Tn+Tn−1=n2T_n + T_{n-1} = n^2
— it turns several triangular-number questions into one line.
Did you know

Why eight times a triangular number is always one short of a square

Take any triangular number, multiply it by eight, and add one. The result is always a perfect square.

- T1=1T_1 = 1: 8(1)+1=9=328(1) + 1 = 9 = 3^2
- T2=3T_2 = 3: 8(3)+1=25=528(3) + 1 = 25 = 5^2
- T3=6T_3 = 6: 8(6)+1=49=728(6) + 1 = 49 = 7^2
- T4=10T_4 = 10: 8(10)+1=81=928(10) + 1 = 81 = 9^2
- T10=55T_{10} = 55: 8(55)+1=441=2128(55) + 1 = 441 = 21^2

The squares produced are 32,52,72,923^2, 5^2, 7^2, 9^2 — the odd squares, in order, with T10T_{10} giving 21221^2.

The algebra is short enough to check. With Tn=n(n+1)2T_n = \frac{n(n+1)}{2}:

8Tn+1=8×n(n+1)2+1=4n(n+1)+1=4n2+4n+1=(2n+1)28T_n + 1 = 8 \times \frac{n(n+1)}{2} + 1 = 4n(n+1) + 1 = 4n^2 + 4n + 1 = (2n+1)^2

And 2n+12n+1 is odd for every whole nn, which is exactly the pattern observed. For n=10n = 10 it gives 2121, matching 441441.

There is also a picture. Eight copies of a triangle of dots can be arranged around a single central dot to fill a square — the one extra dot is the +1+1, and it sits in the middle where the eight triangles cannot reach.

What makes this worth noticing is that the identity is an algebraic rearrangement of a formula you already have. The expression 4n2+4n+14n^2 + 4n + 1 is a perfect square because of the identity (a+b)2=a2+2ab+b2(a+b)^2 = a^2 + 2ab + b^2 from the algebra chapter, with a=2na = 2n and b=1b = 1.

So a fact about stacked dots turns out to be the square of a binomial, and the connection runs through Tn=n(n+1)2T_n = \frac{n(n+1)}{2} — a formula the next part of this chapter derives properly rather than quoting.
Exam relevance

How do sequences feed into JEE Main?

Because the explicit and recursive descriptions become the two standard ways of specifying a series, and recursion is the engine of mathematical induction.

This is the foundation for Class 11 Mathematics Sequences and Series and Principle of Mathematical Induction, both examined in JEE Main. The explicit rule an=dn+(a1−d)a_n = dn + (a_1 - d) found here is the nnth term of an arithmetic progression, written there as an=a+(n−1)da_n = a + (n-1)d — the same expression rearranged. The doubling rule an=3×2n−1a_n = 3 \times 2^{n-1} is the nnth term of a geometric progression. Both standard forms are already on this page under different names, which the next two parts of this chapter make explicit.

Recursion is what induction proves things about. A recursive rule says how each term follows from the last, and induction is the method for proving a closed formula matches it — assume it for n−1n-1, derive it for nn. The conversion worked through here, showing Tn−Tn−1=nT_n - T_{n-1} = n, is precisely the inductive step for the formula Tn=n(n+1)2T_n = \frac{n(n+1)}{2}, and Class 11 questions ask for exactly that argument written formally.

Triangular and square numbers reappear as summation formulas. Class 11 gives

∑k=1nk=n(n+1)2∑k=1nk2=n(n+1)(2n+1)6\sum_{k=1}^{n} k = \frac{n(n+1)}{2} \qquad \sum_{k=1}^{n} k^2 = \frac{n(n+1)(2n+1)}{6}

and the first of those is the triangular-number formula. Questions requiring a sum of a series in nn use these as building blocks, and the identity Tn+Tn−1=n2T_n + T_{n-1} = n^2 is the kind of manipulation that shortens them.

The Fibonacci sequence appears in JEE Advanced and olympiad problems as a recurrence to be analysed, and it is the standard example of why a recursive definition is sometimes the only practical one. Its explicit formula involves irrational numbers and is met much later, which is the honest reason it is left recursive here.

For NTSE and olympiad papers, pattern-continuation and next-term questions appear directly, and the second-differences technique on this page is the reliable method for them.

What the questions look like. For board work, expect write the next three terms with the rule stated, find the nnth term and a specified term such as the twentieth, generate terms from a recursive rule, convert between the two forms, and identify triangular or square numbers. For JEE Main, sequences appear as AP and GP problems, as summations, and as recurrences.

How board and competitive emphasis differ. A board paper rewards the stated rule
and the step-by-step generation. A competitive paper assumes the nnth term formula and tests whether you can sum a series or recognise which progression is hiding in a word problem.

The single trap that costs the most marks. Giving a recursive rule without its starting values, or giving only one where two are needed. an=an−1+an−2a_n = a_{n-1} + a_{n-2} with F1=1F_1 = 1 alone describes infinitely many sequences — 1,1,2,3,51, 1, 2, 3, 5 and 1,4,5,9,141, 4, 5, 9, 14 both obey it. The starting values are part of the answer, and an otherwise perfect rule loses marks without them.
Key takeaways

Sequences, explicit rules and recursion: quick revision

- Write the differences first. Constant differences mean a linear rule; constant ratios mean doubling; growing differences mean squares or triangles.
- 2,5,8,11→14,17,202, 5, 8, 11 \to 14, 17, 20 (add 33). 3,6,12,24→48,96,1923, 6, 12, 24 \to 48, 96, 192 (double). 2,−4,8,−16→32,−64,1282, -4, 8, -16 \to 32, -64, 128 (ratio −2-2).
- 1,4,9,16→25,36,491, 4, 9, 16 \to 25, 36, 49 — square numbers, second differences all 22.
- 1,3,6,10→15,21,281, 3, 6, 10 \to 15, 21, 28 — triangular numbers, differences 2,3,4,52, 3, 4, 5.
- 1,1,2,3,5→8,13,211, 1, 2, 3, 5 \to 8, 13, 21 — Fibonacci, each term the sum of the two before.
- State the rule, not just the terms — a finite list never forces one continuation.
- Explicit rule for constant difference dd: an=dn+(a1−d)a_n = dn + (a_1 - d).
- 2,5,8,112, 5, 8, 11 gives an=3n−1a_n = 3n - 1, so a20=59a_{20} = 59 and a100=299a_{100} = 299.
- 5,9,13,175, 9, 13, 17 gives an=4n+1a_n = 4n + 1, so a20=81a_{20} = 81.
- Squares: Sn=n2S_n = n^2, so S20=400S_{20} = 400. Triangles: Tn=n(n+1)2T_n = \frac{n(n+1)}{2}, so T10=55T_{10} = 55 and T20=210T_{20} = 210.
- Doubling: 3,6,12,243, 6, 12, 24 gives an=3×2n−1a_n = 3 \times 2^{n-1}, so a10=1536a_{10} = 1536.
- "Which term equals kk": solve 3n−1=593n - 1 = 59 to get n=20n = 20. 3n−1=1003n - 1 = 100 gives no whole nn, so 100100 is not a term.
- Check the explicit rule at a second term, since the constant was fitted to the first.
- Recursive rule needs a starting value and a step: a1=2a_1 = 2, an=an−1+3a_n = a_{n-1} + 3.
- T1=1T_1 = 1, Tn=Tn−1+nT_n = T_{n-1} + n generates the triangles; S1=1S_1 = 1, Sn=Sn−1+(2n−1)S_n = S_{n-1} + (2n-1) generates the squares by adding odd numbers.
- Fibonacci needs TWO starting values: F1=F2=1F_1 = F_2 = 1 with Fn=Fn−1+Fn−2F_n = F_{n-1} + F_{n-2}, giving 1,1,2,3,5,8,13,21,34,551, 1, 2, 3, 5, 8, 13, 21, 34, 55.
- The same rule from 2,12, 1 gives 2,1,3,4,7,11,18,292, 1, 3, 4, 7, 11, 18, 29 — the starting values are part of the description.
- Explicit to recursive: subtract. (3n−1)−(3(n−1)−1)=3(3n-1) - (3(n-1)-1) = 3; n2−(n−1)2=2n−1n^2 - (n-1)^2 = 2n-1; Tn−Tn−1=nT_n - T_{n-1} = n.
- Tn+Tn−1=n2T_n + T_{n-1} = n^2: 10+6=1610 + 6 = 16 and 15+10=2515 + 10 = 25, proved by n[(n+1)+(n−1)]2=n2\frac{n[(n+1)+(n-1)]}{2} = n^2.
- 8Tn+18T_n + 1 is always an odd square: 8(10)+1=81=928(10)+1 = 81 = 9^2, since 4n2+4n+1=(2n+1)24n^2+4n+1 = (2n+1)^2.
- Fibonacci has no elementary explicit rule at this stage, which is why both descriptions are needed.

Write out the Fibonacci sequence to the fifteenth term, then divide each term by the one before it and watch what the answers settle towards.

Ready to put this into practice?

Create a personalized quiz on this exact topic — free to start.

Create your own quiz on Predicting What Comes Next: Exploring Sequences and Progressions — Part 1Create a free account
← Back to all articles