We have a recursive function, where each new term f(n) is the previous term f(n-1) multiplied by 3/2.
We start with f(1)=2/3.
Then, we can write the following 4 terms as:
f(2) = f(1) * 3/2 = 2/3*3/2 = 1
f(3) = f(2) * 3/2 = 1 * 3/2 =3/2
f(4) = f(3) * 3/2 = 3/2 * 3/2 = 9/4
f(5) = f(4) * 3/2 = 9/4 * 3/2 = 27/8