Lehmer prime-counting algorithm

A prime counting algorithm that evaluates $\pi (x)$ by recursively counting integers not divisible by the first few primes and correcting for products of larger primes. A small number-theoretic sieve and cached recursive values allow it to handle inputs much larger than the precomputed table.