Since $1$, $3$, and $5$ are all odd, there must be an even number of summands to get to $12$. You can't do it with just two summands, but you can with any even number from four to twelve:
$$\begin{align}
\{3,3,3,3\}&\times1\\
\{5,3,3,1\}&\times12\\
\{5,5,1,1\}&\times6\\
\{3,3,3,1,1,1\}&\times20\\
\{5,3,1,1,1,1\}&\times30\\
\{3,3,1,1,1,1,1,1\}&\times28\\
\{5,1,1,1,1,1,1,1\}&\times8\\
\{3,1,1,1,1,1,1,1,1,1\}&\times10\\
\{1,1,1,1,1,1,1,1,1,1,1,1\}&\times1
\end{align}$$
where the number after the $\times$ is the number of different ways the summands in the given set can be arranged. This gives a total of
$$1+12+6+20+30+28+8+10+1=116$$
This is the quickest way I can think of to get the count for the specific number $12$. (If there's a quicker way, I'd like to see it!) In general, for larger numbers, the recursive formula
$$f(n)=f(n-1)+f(n-3)+f(n-5)$$
as explained in gandalf61's answer, is undoubtedly better. The sequence of $f(n)$'s is A060961 in the OEIS.