Find f(2), f(3), f(4), f(5) if f(n) is defined recursively by f(0)= 0, f(1) = 1, f(n+1) = f(n)+2f(n-1)+1 for n = 1, 2, ....

f(2) = f(1) +2(1-1)+1

f(2) = 2

f(3) = f(2) + 2(2-1)+1

f(3) = 5

f(4) = f(3) + 2(5-1)+1

f(4) = 14

f(5) = f(4) + 2(14-1)+1

f(5) = 41

correct?