Final answer:
The sequence described by the recursive formula f(n-2) = 2f(n-1) - f(n) is the Fibonacci sequence.
Step-by-step explanation:
The sequence described by the recursive formula f(n-2) = 2f(n-1) - f(n) is the Fibonacci sequence.
To see this, let's start with the initial terms: f(0) = 0 and f(1) = 1. Using the recursive formula, we can calculate the rest of the terms:
f(2) = 2f(1) - f(0) = 2(1) - 0 = 2
f(3) = 2f(2) - f(1) = 2(2) - 1 = 3
f(4) = 2f(3) - f(2) = 2(3) - 2 = 4
Continuing this pattern, we can see that the sequence is 0, 1, 2, 3, 4, 5, 6, ... which is the Fibonacci sequence.