How can we prove that
$$\sum_{r=1}^n \binom{2n}{2r-1}\frac{B_{2r}}{r}=\frac{2n-1}{2n+1}$$
where $B_{2r}$ are the Bernoulli numbers?
$$\begin{array}{c|c|c|} n & \frac{2n-1}{2n+1} & \sum_{r=1}^n \binom{2n}{2r-1} \frac{B_{2r}}{r} \\ \hline 1 &\frac{1}{3} & \frac{1}{3} \\ 2 &\frac{3}{5} & \frac{3}{5} \\ 3 &\frac{5}{7} &\frac{5}{7} \\ 4 & \frac{7}{9} & \frac{7}{9} \\ 5 & \frac{9}{11} &\frac{9}{11}\end{array}$$
The formula appears to be correct for a lot of values of $n$.
$$ \sum_{r=1}^n \binom{2n}{2r-1}\frac{B_{2r}}{r} $$ $$ = 2\sum_{r=1}^n \binom{2n}{2r-1}\frac{B_{2r}}{2r} = \frac{2}{2n+1}\sum_{r=1}^n \frac{(2n+1)(2n)!}{2r(2r-1)!(2n-2r+1)!}B_{2r} $$ $$ = \frac{2}{2n+1}\sum_{r=1}^n \frac{(2n+1)!}{(2r)!(2n-2r+1)!}B_{2r} = \frac{2}{2n+1}\left(\sum_{r=0}^n \left(\binom{2n+1}{2r}B_{2r} + \binom{2n+1}{2r-1}B_{2r-1}\right) - \binom{2n+1}{0}B_0-\binom{2n+1}{1}B_1\right) $$ $$ = \frac{2}{2n+1}\left(\sum_{r=0}^{2n} \binom{2n+1}{r}B_{r} - \binom{2n+1}{0}B_0-\binom{2n+1}{1}B_1\right) $$ Since, $$ B_m = -\sum _{k=0}^{m-1}\binom{m}{k}\frac{B_k}{m-k+1} \implies 0 = \sum _{k=0}^{m}\binom{m+1}{k}B_k $$ So, $$ \frac{2}{2n+1}\left(\sum_{r=0}^{2n} \binom{2n+1}{r}B_{r} - \binom{2n+1}{0}B_0-\binom{2n+1}{1}B_1\right)= \frac{2}{2n+1}\left(0-1-(2n+1)(\frac{-1}{2})\right) = \frac{1}{2n+1}\left(2n+1-2 \right) = \frac{2n-1}{2n+1} $$