My current approach is to use a combinatorial argument. The equation can be seen as all possible ways of first choosing $i$ out of a total of $n$ items, and choosing $(i-j)$ items out of the $i$ chosen ones, then choosing $2$ items out of the remaining $j$ items not chosen in the previous step.
So we are choosing ${n \choose i-j+2}$. But we need to subtract the number of times where we are double counting if we first choose $2 = (i-j)$ items out of the $i$ chosen ones, then choosing $2$ items out of the remaining $j$ items not chosen in the previous step, which is a total of $\frac{{n \choose 2} {n-2 \choose 2}}{2}$. So the final answer is ${n \choose i-j+2} - \frac{{n \choose 2} {n-2 \choose 2}}{2}$
Is this argument valid? If not, could someone tell me how I could do it? Thanks. Also, I don't have the correct answer.