Algebra › Section L · Sequences, series, and the binomial theorem › Topic L.1
Sequences
Feed a function only the counting numbers - 1, 2, 3, 4, ... - and list its outputs in order, and you have a sequence: a function wearing a list costume. This topic builds the vocabulary, the general term, factorials, and the summation shorthand that the next two topics stand on.
A sequence is a function in disguise
Take the function \(f(n) = 2n\) and evaluate it only at \(n = 1, 2, 3, 4, 5, \ldots\): the values come out 2, 4, 6, 8, 10, and so on. Written in a row, that list is a sequence. Formally: a sequence is a function whose domain is the counting numbers. The individual numbers in the list are terms. If the domain is all counting numbers, the list never ends - an infinite sequence, marked with trailing dots. Restrict the domain to, say, the first four counting numbers and you get a finite sequence: 2, 4, 6, 8, full stop. Sequences are ordered lists, but the order is not decoration - it is the function's input order showing through.
Notation: the general term
Because the inputs are always \(1, 2, 3, \ldots\), sequences skip ordinary function notation. Instead of \(f(n)\), the \(n\)-th output is written \(a_n\), called the general term: the recipe that produces every term from its position. For \(a_n = 3n - 1\), substitute positions in order: \(a_1 = 2\), \(a_2 = 5\), \(a_3 = 8\), \(a_4 = 11\), \(a_5 = 14\). Reading a general term is pure substitution practice - the only new skill is remembering that \(n\) always starts its climb at 1.
When the variable is an exponent
General terms are not required to be linear. Try \(a_n = 2^n + 3\): the positions slot into the exponent, giving \(a_1 = 5\), \(a_2 = 7\), \(a_3 = 11\), \(a_4 = 19\), \(a_5 = 35\). Exponential general terms like this one grow by doubling, not by adding - the gap between consecutive terms keeps widening (2, then 4, then 8, then 16), a signature that will identify geometric sequences two topics ahead. Whether the variable sits in the base or the exponent is the single biggest driver of a sequence's personality.
Alternating signs
Sequences that flip sign every term need a sign-flipping machine, and the standard one is a power of negative one: \((-1)^n\) evaluates to \(-1\) for odd \(n\) and \(+1\) for even \(n\), so it makes the first term negative. Its cousin \((-1)^{n-1}\) starts positive instead. Bolt either onto a size formula and the signs alternate automatically: \(a_n = (-1)^n \cdot 2n\) produces \(-2, 4, -6, 8, -10, \ldots\). Test the machine yourself - at \(n = 1\), \((-1)^1 \cdot 2 = -2\); at \(n = 2\), \((-1)^2 \cdot 4 = 4\) - and any list whose signs bounce should send you hunting for one of these two factors.
Worked example: finding the general term
Given a list, look for a pattern in sizes and signs separately. The list \(6, 12, 18, 24, 30\): every term is a multiple of 6 - term 1 is \(6 \cdot 1\), term 2 is \(6 \cdot 2\) - so \(a_n = 6n\). The list \(-1, 4, -9, 16, -25\): sizes are squares \((1, 4, 9, 16, 25)\) and the signs alternate starting negative - that is \((-1)^n\) times a square, so \(a_n = (-1)^n n^2\). The list \(\tfrac{1}{2}, \tfrac{1}{4}, \tfrac{1}{8}, \tfrac{1}{16}\): numerators frozen at 1, denominators doubling - \(a_n = \frac{1}{2^n}\). Three patterns cover most textbook lists: multiples, powers, and alternating signs bolted onto either.
Factorial notation
Products of descending consecutive integers appear so often in sequences that they earned their own symbol: \(n!\), read "n factorial," means \(n \cdot (n-1) \cdot (n-2) \cdots 2 \cdot 1\). So \(5! = 5 \cdot 4 \cdot 3 \cdot 2 \cdot 1 = 120\), and the early values run \(1! = 1\), \(2! = 2\), \(3! = 6\), \(4! = 24\). One special definition completes the system: \(0! = 1\), declared by convention so that factorial formulas stay consistent at the boundary - it is a definition to memorize, not to derive. Factorials explode quickly: \(10!\) is already 3,628,800, which is why they dominate the tail of any sequence built from them.
Worked example: factorials in a general term
Write the first five terms of \(a_n = \frac{(n+2)!}{n!}\). Substituting: \(a_1 = \frac{3!}{1!} = 6\), \(a_2 = \frac{4!}{2!} = 12\), \(a_3 = \frac{5!}{3!} = 20\), \(a_4 = \frac{6!}{4!} = 30\), \(a_5 = \frac{7!}{5!} = 42\). The pattern of the answers (6, 12, 20, 30, 42) is no accident: \(\frac{(n+2)!}{n!}\) is a fraction whose denominator cancels everything except the top two factors of the numerator, leaving \((n+1)(n+2)\) - check at \(n = 3\): \(4 \cdot 5 = 20\). Factorial fractions cancel from the bottom up, exactly like the rational expressions of earlier topics, only faster, because the factors are already written in descending order.
Worked example: summation notation
Sequences earn their keep when terms get added. The Greek capital sigma, \(\sum\), is the shorthand for that sum: \(\sum_{i=1}^{5} i^2\) reads "the sum of \(i^2\), with \(i\) running from 1 to 5." Expand and add: \(1 + 4 + 9 + 16 + 25 = 55\). The letter \(i\) is the index of summation, a dummy variable that sweeps through the counting numbers; the bottom number says where it starts, the top says where it stops, and the formula to the right says what gets added at each stop. A finite sum like this one is called a partial sum - a sum of the first however-many terms of a sequence.
The index is flexible
Nothing forces the index to be the letter i, or to start at 1. \(\sum_{k=0}^{3} 2^k\) uses k and starts at zero: substitute \(k = 0, 1, 2, 3\) in order, getting \(2^0 + 2^1 + 2^2 + 2^3 = 1 + 2 + 4 + 8 = 15\). Starting at 0 is common whenever powers are involved, because \(2^0 = 1\) makes the first term clean. The skill is unchanged: list the index values from bottom to top, evaluate the formula at each, and add.
Writing a sum in summation notation
Reverse the process: given \(\tfrac{1}{2} + \tfrac{2}{3} + \tfrac{3}{4} + \tfrac{4}{5}\), find the pattern in the terms. Each fraction is a position over the position-plus-one: \(\tfrac{i}{i+1}\). The positions run 1 through 4, so the sum is \(\sum_{i=1}^{4} \frac{i}{i+1}\). The routine is identical to finding a general term - hunt for the position-pattern in the terms - with one extra decision: the top index counts the terms. Four terms visible means the sigma runs to 4; trailing dots mean it runs to infinity.
Common mistakes to avoid
First, starting the positions at 0 - a sequence's first term is \(a_1\), and plugging \(n = 0\) into \(3n - 1\) produces a phantom term. Second, confusing \(0!\) with 0 - it is defined as 1. Third, canceling factorial fractions from the top: \(\frac{(n+2)!}{n!}\) loses the bottom factors, not the top ones. Fourth, treating sigma as a term rather than an instruction - it means "add these up," and the index is a counter, not a variable to solve for. Fifth, forgetting the alternating-sign machine when signs bounce - if the list flips, some power of \(-1\) is hiding in the general term.
Key takeaways
A sequence is a function whose domain is the counting numbers, written as an ordered list of terms generated by a general term \(a_n\) - infinite if the domain is unlimited, finite if cut short. General terms put \(n\) anywhere: linearly, in exponents like \(2^n\), or with \((-1)^n\) machinery to alternate signs. Pattern-hunting in a list (multiples, powers, sign flips) recovers the general term in reverse. Factorial notation \(n! = n(n-1) \cdots 1\) - with \(0! = 1\) by definition - compresses descending products, and factorial fractions cancel from the bottom up. Summation notation \(\sum_{i=1}^{n} a_i\) adds the terms an index at a time, with the index letter and its start value both free choices, and reversing it means finding the term pattern and counting the terms.
Flashcards
Flashcard
Function on the counting numbers
Test your understanding
Question 1 of 5
What are the first five terms of the sequence with general term a_n = 3n - 1?
Question 2 of 5
What is the value of 5 factorial?
Question 3 of 5
Which general term produces the list -2, 4, -6, 8, -10?
Question 4 of 5
Evaluate the sum of i^2 from i = 1 to 4.
Question 5 of 5
What is 0!?
