If t 1 t 2 t 3 t n is a set of series or a sequence. 1 2 4 8 16 32. The set of wff denoted textbfWFF is the smallest set that satisfies.
As you can observe from the sequence itself it is an arithmetic sequence which includes the first term followed by other terms and a common difference d between each term is the number you add or subtract to them.
The recursive formula is. A recursive formula designates the starting term a1 and the nth term of the sequence an as an expression containing the previous term the term before it an-1. For a sequence a 1 a 2 a 3 a n a recursive formula is a formula that requires the computation of all previous terms in order to find the value of a n. The recursive formula is.