prime counting function
The prime counting function is a non-multiplicative function for any positive real number , denoted as and gives the number of primes not exceeding . It usually takes a positive integer for an argument. The first few values of for are (http://www.research.att.com/ njas/sequences/eisA.cgi?Anum=000720OEIS A000720).
The asymptotic behavior of is given by the prime number theorem. This function is closely related with Chebyshev’s functions and .