This is a method for approximating the integral that I consider interesting. It makes use of the integrals $J(n)$ for $n$ odd defined at the question.
Consider the functions
\begin{equation}
a_k(x) = e^{-rx^2 + (2k - 1/2)x} \in L^2(\mathbb R), \mbox{ for } k \in \mathbb Z \\
b_k(x) = \frac{a_k}{\|a_k\|_2} \\
h(x) = e^{-rx^2 + x/2} \\
f(x) = \frac{e^{-x/2}}{e^x + e^{-x}}
\end{equation}
With these definitions, the integral we want to compute takes the form $\langle f, h \rangle$ in $L^2(\mathbb R)$.
Call $S$ the closure of the subspace generated by $\{b_k \}_{k \in \mathbb Z}$, and $P_S$ the orthogonal projection to $S$. After computing the norms $\|a_k\|_2$ we reach
$$A_{ij} := \langle b_i, b_j \rangle = e^{-(i-j)^2 / (2r)}$$
We can compute $P_S(h)$ since the coordinates $\langle h, b_k \rangle$ are definite integrals of Gaussian functions. We can also compute $P_S(f)$ because each $\langle f, b_k \rangle$ is a constant times $J(2k-1)$.
This means that we can accurately and efficiently compute $\langle P_S(f), h \rangle$ by solving a linear system. I've done this, and found out that this is a very good approximation of $\langle f, h \rangle$. By comparing with an online integration tool, the error is in the order of $10^{-6}$ for $r=1$. It gets better for larger $r$ and worse for lower $r$. Therefore it seems that $f, h \notin S$.
There are variants for the definitions of the auxiliary functions leading to similar results. Possibly there are choices that reduce the error.
This method can also be applied to small values of $r$ thanks to the formula at Carlo Beenakker's answer.