Hi Adriana,
Given that: f(1)=3 and f(n)=f(n-1)+2 for n>2
We already know what f(1) is so lets use that to determine f(2) So f(2)=f(2-1)+2 , and f(2)=f(1)+2, f(2)=5
We now have the first couple of terms, additional terms can be calculated from the recursion formula
f(1)=3
f(2)=5
f(3)=7
f(4)=9 and so on
Got it?
Jim