Fórmula Contadora de Números Primos menor a 10^n

Comparto esta bella curiosidad matemática de mi autoría.

I share the counting formula of prime numbers <10 ^ n, which for its execution seems impractical in nature, yet it is a beautiful mathematical curiosity.

This is the code en Matemathica... 

Table[ Sum[ Floor[2/ (Sum[ (n - Mod[n, k] ) /k + (1 - n + Mod[n - 1, k])/k , {k, 1, n}] ) ] , {n, 1, 10^n} ] - 2, {n, 0, 2}]