Solving recurrence relation: Product form Please help in finding the solution of this recursion. 
$$f(n)=\frac{f(n-1) \cdot f(n-2)}{n},$$
where $ f(1)=1$ and $f(2)=2$.

I believe the formula is, for $n\geq 3$,
$$f(n) = 2^{F_{n-1}}\prod_{k=3}^{n}k^{-F_{n-k+1}}$$
where $F_1,F_2,F_3,\ldots$ is the standard Fibonacci sequence whose first two terms are $1$.
You can see this by just writing out the first several terms. For example,
$$f(9) =\dfrac{2^{21}}{3^{13}4^8 5^5 6^3 7^2 8^1 9^1}
$$
Addendum (Inductive Proof): The base case ($n=3$) is trivial, since
$$f(3)=\dfrac{f(2)f(1)}3=\dfrac{2\cdot 1}3 = \frac23=2^1 3^{-1}=2^{F_2}3^{-F_1}$$
For the inductive step, suppose the formula holds for $3,\ldots,n$. We show it holds for $n+1$ as follows:
$$
f(n+1)=\frac{f(n)f(n-1)}{n+1}=(n+1)^{-1}\cdot \left(2^{F_{n-1}}\prod_{k=3}^{n}k^{-F_{n-k+1}}\right) \cdot \left(2^{F_{n-2}}\prod_{k=3}^{n-1}k^{-F_{n-k}}\right)
$$
$$
= 2^{F_{n-1}+F_{n-2}}(n+1)^{-F_2}\cdot \left(n^{-F_1}\prod_{k=3}^{n-1}k^{-F_{n-k+1}}\right)\cdot \left(\prod_{k=3}^{n-1}k^{-F_{n-k}}\right)
$$
$$
= 2^{F_n}(n+1)^{-F_2}n^{-F_1}\prod_{k=3}^{n-1}k^{-F_{n-k+1}-F_{n-k}}
= 2^{F_n} \prod_{k=3}^{n+1}k^{-F_{n-k+2}}
$$
$$
=2^{F_{(n+1)-1}} \prod_{k=3}^{n+1}k^{-F_{(n+1)-k+1}}
$$
as required. $\blacksquare$
