I'm trying to solve this sum or at least give an approximation.
$$\sum_{j=1}^{n-1}\frac{2j}{(n-j+1)(j+n)}$$
This was my attempt:
Assuming that in my sum $\sum f(j)$, $f(j)$ is a monotonically increasing function, then I can approximate the sum by the following rule:
$$\int_{m-1}^{n} f(x) dx \leq \sum_{j=m}^{n} f(j) \leq \int_{m}^{n+1} f(x)dx$$
So I need to solve this integral:
$$\sum_{j=1}^{n-1}\frac{2j}{(n-j+1)(j+n)} \leq \int_{1}^{n} \frac{2j}{(n-j+1)(j+n)}dj = \frac{2(\ln n+n \ln (\frac{n+1}{2}))}{2n+1}$$
Then since,
$$\frac{2(\ln n+n\ln(\frac{n+1}{2}))}{2n+1} = \frac{2 \ln n}{2n + 1} + \frac{2 n \ln (\frac{n+1}{2})}{2n + 1}$$
The upper bound for the both terms is
$$O\left(\frac{\ln n}{n}\right) + O(\ln n) = O(\ln n)$$
Then if my calculations are correct I should can prove by induction that, the following inequality holds, for some constant $c$.
$$\sum_{j=1}^{n-1}\frac{2j}{(n-j+1)(j+n)} \leq c\ln(n)$$
But I don't know how to prove it.
Let $$s_n=\sum_{j=1}^{n-1}\frac{2j}{(n-j+1)(j+n)}$$ Now, define $$a_n=\sum_{j=1}^{n-1}\frac{1}{n-j+1}$$ and $$b_n=\sum_{j=1}^{n-1}\frac{1}{j+n}$$ Then $$\begin{split} a_n-b_n &= \sum_{j=1}^{n-1}\bigg(\frac{1}{n-j+1}-\frac{1}{j+n}\bigg)\\ &= \sum_{j=1}^{n-1}\frac{2j-1}{(n-j+1)(j+n)}\\ &= s_n-\sum_{j=1}^{n-1}\frac{1}{(n-j+1)(j+n)} \end{split} $$ Also $$\begin{split} a_n+b_n &= \sum_{j=1}^{n-1}\bigg(\frac{1}{n-j+1}+\frac{1}{j+n}\bigg)\\ &= \sum_{j=1}^{n-1}\frac{2n+1}{(n-j+1)(j+n)}\\ \end{split} $$
Therefore $$a_n-b_n=s_n-\frac{a_n+b_n}{2n+1}$$ In other words $$s_n=\frac{2n+2}{2n+1}a_n-\frac{2n}{2n+1}b_n$$
Now we need to estimate $a_n$ and $b_n$.
Changing $j$ into $n-j+1$ in the definition of $a_n$ yields $$a_n=\sum_{j=2}^{n}\frac1j$$ So $a_n \approx \ln n$ (see harmonic series).
For $b_n$, note that it's a Riemann sum: $$b_n=\frac 1 n \sum_{j=1}^{n-1}\frac{1}{\frac j n +1}$$ therefore $$b_n\approx \int_0^1\frac {dx}{1+x}=\ln 2$$
We conclude that $$s_n\approx \ln n$$