Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
This is a special fact about $\mathrm{SU}(2)$. One looks at the action of diagonal matrices $\mathrm{diag}(u,1/u)$ on the representation. An irreducible representaion breaks up into "weight spaces" where this matrix multiplies the vector by $u^j$. The representation $V_j$ splits into one-dimensional weight spaces of weights $-j$, $-(j-2)$, $-(j-4),\dots,j$. To count the number of irreps of a given type in a finite-dimensional representation one does a census of the weight spaces. If you do that for $V_i\otimes V_j$ you find that the stated irreps turn up just once each.
Take for example $n=4.5$. Then the sequence $(f_n(x))$ goes 0, 0, 0, 1, 0, 0, and it stays at 0 from then on, so it converges to 0. Exactly the same thing will happen for any $x$.
Your opinions are normative statements: "one should" and "it is better". It is naive to suppose that there is one best method that one should use to compute the matrix exponential.
The convergence of this general form is related to the irrationality measure of $\pi$, that is the infimum of exponents $k$ such that $|\pi-a/b|<1/b^k$ has only finitely many integer solutions. (For $|\sin n|$ to be small, $n$ must be close to an integer multiple $m\pi$ of $\pi$ and then $|\sin n|\sim m|\pi-n/m|$.) Results are known (see for instance planetmath.org/encyclopedia/IrrationalityMeasure.html) and these will yield explicit values of $a$, $b$ for which the series converges, but the proofs are delicate and don't yield the best expected result.
$x$ has order $-2$ at $\infty$, so if $t$ is a uniformizer there, $x= a_{-2} t^{-2} + a_{-1} t^{-1}+\cdots$ where $a_{-2}\ne0$. So what does dx look like in terms of $t$ and $dt$?