Arithmetic sequence formulas
Before we combine both topics of formulas and arithmetic sequences, let’s define what arithmetic sequences mean. As the name suggests: arithmetic sequences are sequences of arithmetic sums. An example of a positive arithmetic sum is: 2,4,6,8,10. A number in a sequence is called a term.
Now, let’s combine formulas to the equation. In addition to the way we used to describe arithmetic sequences like I did above, there is another way by utilizing formulas. The two new ways I’ll be talking about are recursive formulas and explicit formulas. Formulas give us instructions on how to find any term of a sequence, much like an array or list in programming.
In formulas, n is used to represent any term number and a(n) to represent the n’th term of the sequence. To give an analogy from programming: n is the input for the formula and a(n) returns the outcome of the formula.
Here’s is an example taken from Khanacademy:
As we can see from the illustration above, n, representing the term number within a sequence, acts as the input for our formula while a(n) returns the result of the sequence.
Recursive formulas of arithmetic sequences
Before we look into the what a recursive formula is, let’s look at what the recursive actually means. The word recursive, usually used in the context of mathematics and linguistics, means that something is related to or involved with repeated application of a rule. As we further explain recursive formulas, we’ll be able to see that the formula holds true to its name.
Recursive formulas provides two pieces of information:
1. The first term of a sequence;
2. The pattern rule to get any term in a sequence from the term that comes before it.
An example of a recursive formula of the following sequence: 3,5,7 is written below:
a(1) = 3 //The first term is three
a(n) = a(n-1) + 2 // Add two to the previous term which is represented by n-1.
As can be seen in the example above, we can derive 1) the first term of the formula (3); and 2) the pattern rule that is being added to the previous term (+2).
In order to find the fifth term, for example, we’d need to extend the sequence term by term. See the snapshot taken from Khanacademy below:
The only disadvantage of this is that we’d need to calculate the terms step by step in order to get to n=5 as we don’t know what the contents of the formula are.
Explicit formulas of arithmetic sequences
An example of an explicit formula is as given below:
The advantage of an explicit formula as opposed to a recursive formula is that we can plug in any number of the term that we’d like to know to get the value of the term. To find the fifth term, for example, we need to plug in n=5 into the explicit formula:
As we can see from the illustration above, we are now able to read the inside-outs of the formula which we previously couldn’t with the recursive formula.
If we were to decompose the formula, we’d see that the initial value of the formula is 3. The number that is being added every term is 2.
Since sequences are always functions, it’s not possible to input any negative or decimal numbers in the formula. This means that the domain of the sequences -- which is the set of all possible inputs of the function -- is the positive integers.
Outside of the previously used a(4) notation, other sources sometimes write a4, with 4 having a smaller font. Both notations are fine to use, but Khanacademy has a preference of using a(4) because it emphasizes that sequences are functions.