While your approach is definitely flawed, you did get to the root of the problem!
You choose the remaining spots perfectly well, but you do not consider how many possible choices there are for the first 3 spots. So, while "order does not matter" (i.e. you will be using combinations) there are multiple combinations of individuals to choose. As a matter of fact, we have $10$ freshman and must choose $2$, and we have $6$ seniors and must choose one.
The temptation is to, at this point, simply take ${10 \choose 2}{6 \choose 1}{13 \choose 2}$. But this won't work, as we are now going to be double counting, that is, when we have the $13 \choose 2$ those will be considerations that we have already made in the previously selections.
As such, there are a couple ways to approach such a counting problem. One way, that is less elegant, but definitely instructive, is to enumerate the possible counting combinations. That is we could have:
\begin{align}
\begin{array}{c | c | c}
Freshman & Seniors & Combinations \\
\hline
4 & 1 & {10 \choose 4}{6 \choose 1} = 1260\\
3 & 2 & {10 \choose 3}{6 \choose 2} = 1800 \\
2 & 3 & {10 \choose 2}{6 \choose 3} = 900 \\
\hline
& & Total = 3960
\end{array}
\end{align}