First, show the base case $P_2$ is true:
$$\prod_{j=2}^2\left(1-\frac{1}{\sum\limits_{k=1}^j(k)} \right)=\frac{2+2}{3(2)}$$
$$1-\frac{1}{\sum\limits_{k=1}^2(k)}=\frac{4}{6}$$
$$1-\frac{1}{1+2}=\frac{2}{3}$$
$$\frac{2}{3}=\frac{2}{3}$$
Thus, the base case is true. Next, state the induction hypothesis $P_n$:
$$\prod_{j=2}^n\left(1-\frac{1}{\sum\limits_{k=1}^j(k)} \right)=\frac{n+2}{3n}$$
As the inductive step, multiply by:
$$1-\frac{1}{\sum\limits_{k=1}^{n+1}(k)}=\frac{n(n+3)}{(n+1)(n+2)}$$
and we have:
$$\prod_{j=2}^{n+1}\left(1-\frac{1}{\sum\limits_{k=1}^j(k)} \right)=\frac{n+2}{3n}\left(\frac{n(n+3)}{(n+1)(n+2)} \right)$$
$$\prod_{j=2}^{n+1}\left(1-\frac{1}{\sum\limits_{k=1}^j(k)} \right)=\frac{1}{3n}\left(\frac{n(n+3)}{n+1} \right)$$
$$\prod_{j=2}^{n+1}\left(1-\frac{1}{\sum\limits_{k=1}^j(k)} \right)=\frac{(n+1)+2}{3(n+1)}$$
We have derived $P_{n+1}$ from $P_n$ thereby completing the proof by induction.