We consider the rainbow Schur number $RS_m(n)$, defined to be the minimum number of colors such that every coloring of $\{1,2,\ldots,n\}$, using all $RS_m(n)$ colors, contains a rainbow solution to the equation $x_1+x_2+\cdots +x_{m-1}=x_m$. Recently, the exact values of $RS_3(n)$ and $RS_4(n)$ were determined for all $n$. In this paper, we expand upon this work by providing a formula for $RS_m(n)$ that holds for all $m \geq 4$ and all $n$. A weakened version of the rainbow Schur number is also considered, for which one seeks solutions to the above-mentioned linear equation where, for a fixed $t \leq m$, at least $t$ colors are used.