Harmonic numbers and the prime counting function

We provide approximations to the prime counting function by various discretized versions of the logarithmic integral function, expressed solely in terms of the harmonic numbers. We demonstrate with explicit error bounds that these approximations are at least as good as the logarithmic integral approximation. As a corollary, we provide some reformulations of the Riemann hypothesis in terms of the prime counting function and the harmonic numbers.