Well it take my a little bit of time to find it but now I think that my conjecture is ready . Conjecture :
Let $n\geq 100$ and then define the sum :
$$S(n)=\sum_{k=1}^{n}\frac{1}{\operatorname{argtanh}\left(\frac{k}{k+1}\right)}$$
Then we have :
$$\lceil{S(n)}\rceil\leq 2\pi(n)$$
Where we see the ceiling function and the prime counting function .Nicely the equality case is $n=100$ . I have checked my conjecture with wolfram alpha up to $n=1000$ and extra values of $n$ up to $n=1000000$
Obviously I'm inspired by the prime number theorem and it's not a chance if I choose $\operatorname{argtanh}$ in my conjecture .
I have several questions:
Well first I would like to know if it's true for larger $n$ . Is my conjecture equivalent to other conjecture (stronger or weaker conjecture) . Can we improve the conjecture by adding (by example) a fixed exponent ? What my conjecture involves ? If it's not true for small $n$ can we take a larger $n$ to start with ?
Thanks!