While arithmetic and geometric sequences involve a rule that uses a constant number, recursion sequences use the terms themselves in the rule. One term in recursion sequences is determined from using the terms before it. This concept of recursion sequences can be difficult to fully comprehend, but is found often in mathematics. For example, the Fibonacci sequence is a famous recursion sequence.
Sample Problems (6)
Need help with "Recursion Sequences" problems? Watch expert teachers solve similar problems to develop your skills.
Given a1 = 1, a2 = 2, and an = 2an−1 + an−2