I am currently trying to build the derivatives of $$f(x) = \frac{1}{e^x+e^{-x}}.$$ It is fairly straightforward to obtain $$ \frac{d^n f}{dx^n} = \frac{P_n(e^x)}{e^{(n-1)\cdot x} (e^x+e^{-x})^{n+1}}, $$ where $P_n(x)$ is given by the recursive relationship $P_0(x) = 1$ and $$P_{n+1}(x) = P_n'(x) \cdot x \cdot (x^2+1) - P_n(x)((2\cdot n +1)\cdot x^2-1). $$ If we represent $P_n(x)$ by $\sum_{i = 0}^n a^{(n)}_{2i} x^{2i}$, then we have $a_0^{(n)} = 1$ for all $n$, $a_{2k}^{(n)} = 0$ for all $k > n$, and $$a_{2i}^{(n+1)} = (2i+1) \cdot a_{2i}^{(n)} - (2(n-i)+3) \cdot a_{2 \cdot (i-1)}^{(n)}$$ for all $n \geq 0$ and $0 < i \leq n+1$. So we can obtain with this relationship, that $a_{2n}^{(n)} = (-1)^{n}$ and that $a_2^{(n)} = -3^n +k +1$. However, I am wondering whether we can say something about the maximum of $|P_n(e^x)/e^{2n}|$ for each $n$ or the maximum of $\max_{0 \leq i \leq n} |a_{2i}^{(n)}|$ over each $n$.

**Edit:** It seems that $\sum_{i=0}^n |a_{2i}^{(n)}| = n! \cdot 2^n$.