Let $r\in \lbrack 0,\infty)$. Define $f(x) = 1/(1+x^2)^r$. It would seem to be the case that $$|f^{(k)}(x)|\leq \frac{2r \cdot (2r+1) \dotsb (2r + k-1)}{(1+x^2)^{r + k/2}}$$ for all even $k\geq 0$. What would be a clean, short proof?
Note that $$\left(\frac{1}{(1+x^2)^r}\right)^{(k)} = \frac{P_k(x)}{(1+x^2)^{r+k}},$$ where $P_k\in \mathbb{Z}\lbrack x\rbrack$ is given by the recurrence formula $$P_k(x)=1,\;\;\;\;\;\;P_{k+1}(x) = P_k'(x) (1+ x^2) + 2 (r+k)\cdot x P_k(x).$$ It should not be too hard to work out all the coefficents of $P_k(x)$; the leading terms are $$(-1)^{k+1} \cdot 2r \cdot (2r+1) \dotsb (2r + k-1)\cdot \left(x^k - \binom{k}{2} \frac{x^{k-2}}{2 r + 1} + \dotsc\right).$$ The desired bound should then follow after some work -- but I am hoping for a better proof.