A special case of Ramanujan's master theorem for integrating even functions over the positive reals was found by Glaisher in the late 19th century. If $f(x)$ is an even function with a series expansion around zero of the form:
$$f(x) = \sum_{n=0}^{\infty}(-1)^n c_n x^{2n}$$
then
$$\int_0^{\infty}f(x) dx = \frac{\pi}{2}c_{-\frac{1}{2}}$$
if the integral converges. Here the rigorous definition of $c_{-\frac{1}{2}}$ follows from the rigorous statement of Ramanujan's master theorem, but in practice one can simply analytically continue the $c_k$ to fractional values of $k$ in a natural way, e.g. by replacing factorials by gamma functions etc.
In this case, we have:
$$c_n = \sum_{k=0}^n\frac{1}{2k+1}\tag{1}$$
The natural way to analytically continue integer limits of summations to the reals or the complex plane is given here. To evaluate $c_{-\frac{1}{2}}$ one can consider the large $n$ asymptotic expansion of $c_n$, treating $n$ as a continuous variable there allows one to shift lower limit of the summation to $\frac{1}{2}$, allowing one to extract the value of the summation from 0 to $-\frac{1}{2}$.
From the asymptotic formula:
$$\sum_{k=1}^{n}\frac{1}{k} = \log(n) +\gamma +\mathcal{O}\left(n^{-1}\right)\tag{2}$$
we can derive the large $n$ asymptotics of $c_n$ by considering the summation over even $k$:
$$\sum_{k=1}^{n}\frac{1}{2k} = \frac{1}{2}\sum_{k=1}^{n}\frac{1}{k} =\frac{1}{2}\log(n) +\frac{1}{2}\gamma +\mathcal{O}\left(n^{-1}\right)\tag{3}$$
Using(2) and (3) we can then write:
$$c_n = \sum_{k=1}^{2n+2}\frac{1}{k} - \sum_{k=1}^{n+1}\frac{1}{2k} = \log(2) + \frac{1}{2}\log(n+1)+\frac{1}{2}\gamma +\mathcal{O}\left(n^{-1}\right)\tag{4}$$
Then the summation to $n$ in (1) can also be written as a summation to some arbitrary $u$ plus the summation from $u+1$ to $n$. This rule continues to hold for fractional summations whren $u$ and $n$ are arbitrary real or complex numbers. We thus have:
$$c_n = c_{-\frac{1}{2}} + \sum_{k=\frac{1}{2}}^n \frac{1}{2k+1}\tag{5}$$
We can write:
$$\sum_{k=\frac{1}{2}}^n \frac{1}{2k+1} = \sum_{k=1}^{n+\frac{1}{2}} \frac{1}{2k} = \frac{1}{2}\log\left(n+\frac{1}{2}\right) +\frac{1}{2}\gamma +\mathcal{O}\left(n^{-1}\right)$$
Inserting this in (5) and using (4), we then find:
$$c_{-\frac{1}{2}} = \log(2) + \frac{1}{2}\log(n+1) - \frac{1}{2}\log\left(n+\frac{1}{2}\right) + \mathcal{O}\left(n^{-1}\right)$$
Since there cannot be any dependence on $n$, the r.h.s. is actually a constant but this is not visible to us as we're not keeping track of any $\mathcal{O}\left(n^{-1}\right)$ terms. But taking the limit of $n\to\infty$ makes it clear that $c_{-\frac{1}{2}} = \log(2)$, therefore:
$$\int_0^{\infty}\frac{\arctan(x)dx}{x(1+x^2)}=\frac{\pi}{2}\log(2)$$