This site is supported by donations to The OEIS Foundation.

# Talk:Prime counting function

## Representations for ${\displaystyle \pi (n)}$

Many are very trivial and not really worth keeping... I think it's better to stick to the interesting ones. — Daniel Forgues 20:51, 30 May 2013 (UTC)

I agree. Probably the section needs to go entirely, though the interesting ones might go to a page like Formulas for primes. Charles R Greathouse IV 17:20, 31 May 2013 (UTC)

## Approx

The one listed in the Wikipedia article is pretty good (if I've copied it correctly)ref1

=n*(ln(n*ln(n))-1)+n/ln(n)*(ln(ln(n))-2)

--Bill McEachen 00:37, 2 September 2014 (UTC)