Educator

Recursion and Special Sequences

• If a sequence is defined so that it depends on the value of the previous term, then to find the kth term, you must first compute terms 2, 3, 4, …, and k – 1. You will be given the first term.

• This same comment applies to finding the kth iterate of a function. You must first compute the 1^st, 2^nd, …, and (k – 1)st iterates.

• In calculating iterates, always evaluate each iterate for the numerical value x₀ you are given.