Find a recursive definition for the sequence 2, 3, 5, 9, 17,... Assume the first term in the sequence is indexed by 1, and enter $f_{n-1}$ as $f(n-1)$.

$f(1) =$ and $f(n)$ = for $n > 1$.