
Sequence - A sequence is an ordered list of numbers arranged according to a rule. Each number in the list is called a term of the sequence. A sequence is usually written as (a1, a2, a3, ...) or {an} where an denotes the nth term.
Example of a simple sequence: (1, 3, 5, 7, 9, 11, ...). This sequence consists of the odd natural numbers and continues indefinitely. If a sequence has infinitely many terms it is called an infinite sequence. If it stops at a last term, for example (1, 3, 5, 7, ..., 131), it is a finite sequence.
We denote the nth term by an. A sequence is fully specified when a rule to compute an for every positive integer n is given, together with the index at which the sequence starts (commonly n = 1).
The Fibonacci sequence is a well-known example defined by fixed first two terms and a recurrence relation. The first two terms are
a1 = 1, a2 = 1.
Every term from the third onwards is the sum of the two preceding terms. Thus
an = an-1 + an-2, for n ≥ 3.
The sequence begins as (1, 1, 2, 3, 5, 8, 13, ...).
An explicit closed form (Binet's formula) for the nth Fibonacci number is
Fn = (φn - ψn) / √5, where φ = (1 + √5) / 2 and ψ = (1 - √5) / 2.
an = a1 + (n - 1)d.
an = a1 rn-1.
an = An2 + Bn + C, and the constant second difference equals 2A.
A series is the sum of the terms of a sequence. If {an} is a sequence, the sum of the first n terms is the nth partial sum and is denoted by Sn:
Sn = a1 + a2 + ... + an = ∑k=1n ak.
An infinite series is the limit of the partial sums as n → ∞. If the limit exists (finite), the series converges; otherwise it diverges.
1 + 2 + ... + n = n(n + 1) / 2.
12 + 22 + ... + n2 = n(n + 1)(2n + 1) / 6.
13 + 23 + ... + n3 = [n(n + 1) / 2]2.
Sn = n/2 [2a1 + (n - 1)d] = n/2 [a1 + an].
Sn = a1 (1 - rn) / (1 - r).
S = a1 / (1 - r).
Question: Identify the sequence of the following function n (n+1)
4, 10, 18, 28...
4, 12, 18, 28...
2, 10, 18, 28...
4, 10, 18, 28...
Solution:
We interpret the question as asking for the sequence produced by the function n(n + 1) when n = 1, 2, 3, ...
Compute values of n(n + 1):
For n = 1, n(n + 1) = 1 × 2 = 2.
For n = 2, n(n + 1) = 2 × 3 = 6.
For n = 3, n(n + 1) = 3 × 4 = 12.
For n = 4, n(n + 1) = 4 × 5 = 20.
Thus the sequence generated by n(n + 1) is (2, 6, 12, 20, ...). None of the option rows as written exactly match this sequence. If instead the intent was n(n + 3), then:
For n = 1, n(n + 3) = 1 × 4 = 4.
For n = 2, n(n + 3) = 2 × 5 = 10.
For n = 3, n(n + 3) = 3 × 6 = 18.
For n = 4, n(n + 3) = 4 × 7 = 28.
So the list (4, 10, 18, 28, ...) corresponds to the function n(n + 3), not to n(n + 1).
Question: Adding first 100 terms in a sequence is
A. term
B. series
C. constant
D. sequence
Solution:
Adding (summing) the first 100 terms of a sequence produces the 100th partial sum, which is an example of a series (specifically the sum of the first 100 terms). Therefore the correct choice is B. series.
Example 1: Find the nth term and the sum of the first n terms of the AP 5, 8, 11, 14, ...
First term a1 = 5 and common difference d = 3.
The nth term is
an = 5 + (n - 1) × 3 = 3n + 2.
The sum of the first n terms is
Sn = n/2 [2 × 5 + (n - 1) × 3] = n/2 (10 + 3n - 3) = n/2 (3n + 7).
Example 2: For the GP 2, 6, 18, 54, ... find the sum of the first 5 terms.
First term a1 = 2, common ratio r = 3. Sum of first 5 terms is
S5 = 2 (1 - 35) / (1 - 3) = 2 (1 - 243) / (-2) = 242.
Summary - A sequence is an ordered list of terms defined by a rule; a series is the sum of terms of a sequence. Important types include arithmetic and geometric sequences, and special sequences such as the Fibonacci sequence. For series, formulas for sums of AP and GP and the idea of convergence are central. Practice computing nth terms and partial sums, and apply tests for convergence when dealing with infinite series.
| 1. What is a sequence? | ![]() |
| 2. What is a series? | ![]() |
| 3. What is the difference between an arithmetic sequence and a geometric sequence? | ![]() |
| 4. How can I find the nth term of an arithmetic sequence? | ![]() |
| 5. Is there a formula to find the sum of a geometric series? | ![]() |