We will investigate the evaluation of recursive sequences.
A iterative sequences are categorized by two values i.e one value preceding and the current value. The current value is evaluated on the basis of the previous value. In other words the current value is a function of preceeding value or depends on it.
All iterative relations of a sequence are expressed mathematically by two values as follows:
A iterative relation is a unique mathematical relationship between the current term f ( n ) and the previous value given as follows:
For this particular relationship the first term value is given as follows:
We will now start determining the terms in the sequence by plugging the respective term numbers ( n ) and use the mathematical relationship for the sequence as follows:
We have evaluated the 2nd term in the sequence as 13. We will repeat the above steps for all term numbers ( n = 3 , 4 , 5 , 6 ).
And them lastly for the 6th term in the sequence as follows:
Hence, the answer to the 6th term number is: