Therefore, the first four terms of this sequence are Into the formula and use the fact that 𝑇 = 1 2 to get Into the formula and use the fact that 𝑇 = 1 1 to getįinally, to find 𝑇 , we substitute 𝑛 = 3
Similarly, to find 𝑇 , we substitute 𝑛 = 2 To find the second term, 𝑇 , we substitute 𝑛 = 1 into the recursive formula We already know the first term, which is 𝑇 = 1 0 . Suppose we areĪsked to find the first four terms of the sequence defined by the recursive
This process is best illustrated through some specific examples. In this way, we canīuild up the sequence until it has as many terms as we wish. The formula with 𝑛 = 2 to derive the value of Once we know the value of 𝑇 , we can use 𝑇 = 𝑓 ( 𝑇 ) , we can use the formula with If we know the first term, 𝑇 , and the recursive formula To generate a sequence from its recursive formula, we need to know the first Of a sequence using a preceding term or terms.Ī recursive formula of the form 𝑇 = 𝑓 ( 𝑇 ) ĭefines each term of a sequence as a function of the previous term. Definition: Recursive Formula of a SequenceĪ recursive formula (sometimes called a recurrence relation) is a formula that