For my quantum mechanics homework, I developed the transcendental equation $\frac{\xi}{2}(1+\tanh(\xi))$ for the well-posedness of symmetric potential formed from two delta functions. The professor encourages us to use a numerical tool to solve the equation $$\frac{\xi}{2}(1+\tanh(\xi))=\lambda$$ for $\xi(\lambda)$; however, I was curious if the Lagrange inversion theorem could be employed instead.
Taking $B_n$ to represent a Bernoulli number, we have
$$ \begin{eqnarray} \tanh x &=& x - \frac {x^3} {3} + \frac {2x^5} {15} - \frac {17x^7} {315} + \cdots = \sum_{n=1}^\infty \frac{2^{2n}(2^{2n}-1)B_{2n} x^{2n-1}}{(2n)!}, \left |x \right | < \frac {\pi} {2} \\ \end{eqnarray} $$
could I pose the transcendental equation as
$$ \frac{\xi}{2} + \sum_{n=1}^\infty \frac{2^{2n-1}(2^{2n}-1)B_{2n} \xi^{2n}}{(2n)!} = \lambda $$
Excerpting from Wikipedia, if $g$ shall be the inverse of $f$, where $f$ is given by a formal power series as $$f(w) = \sum_{k=0}^{\infty}f_k\frac{w^k}{k!}$$ $$g(z) = \sum_{k=0}^{\infty}g_k\frac{z^k}{k!}$$ then $$g_1=\frac{1}{f_1}$$ and $$g_n = \frac{1}{f_1^n}\sum_{k=1}^{n-1}(-1)^k n^{(k)} \mathcal B_{n-1,k}\left(\frac{f_2}{2f_1},\frac{f_3}{3 f_1},\dots,\frac{f_{n-k+1}}{(n-k+1)f_1}\right)$$ where $n^{(k)}$ is the rising factorial and $\mathcal B$ is a Bell polynomial.
Question: Are there any further simplifications that I can use? Currently, the presence of Bell polynomials seems discouraging as the performance of this algorithm. Also, can I work around the stipulation $|\xi|<\frac{\pi}{2}$? There are some solutions that exist outside of that regime for sufficiently high $\lambda$. Could I partition the function $\frac{\xi}{2}(1+\tanh(\xi))$ into intervals of length $\frac{\pi}{2}$ and apply the result to each of them?