I'm interested in calculations involving the Euler-Macheroni constant and the so-called Gregory coefficients $G_n$, see the related Wikipedia. Today from an inequality I have got this series
$$\sum_{n=1}^\infty|G_n|\log\left(\frac{n+1}{n}\right).\tag{1}$$
I know how get a lower and an upper bound like these $$0.395908<\sum_{n=1}^\infty|G_n|\log\left(\frac{n+1}{n}\right)<0.439844,\tag{2}$$
or improvements of this inequality.
But I would like to how improve my approximation for such series, I did a draft using partial summation and another using Abel' summation lemma, from which I think that these don't work.
Question. What is a strategy to get and justify a good approximation (four or six right digits) of $$\sum_{n=1}^\infty|G_n|\log\left(\frac{n+1}{n}\right),$$ where $G_n$ denote the Gregory coefficients? Many thanks.
If it is in the literature feel free to answer as a reference request, and I try to find and to read such proposition from the literature.