Yes, except that usually recurrence equations are written in the form f(n + 1) = F(f(n)) for some expression F.
Edit: The above is incorrect. It is just the original equation in a different form. Apparently, you need the solution, i.e., the formula f(n) = F(n) for some expression F that consists of arithmetic operations and n but not f.
f(2) = 3 * f(1)
f(3) = 3 * f(2) = 3^2 * f(1)
f(4) = 3 * f(3) = 3 * 3^2 * f(1) = 3^3 * f(1)
You can guess what f(n) is.