Consider the following recurrence relation:

f(1) = 1; f(2) = 1; f(3) = 1; f(4) = 3; f(5) = 5;

f(n) = f(n 1) + 3 * f(n 5) for n > 5.

Compute f(15). Compute f(7).