reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
(PARI) nestpi(n, m) = { localmy(x, y, z); for(x=1, n, z=10^x; for(y=1, m, z=piprimepi(z)); print1(z", ")) } pi(n) = \pi(n) Prime count function { local(c, x); c=0; forprime(x=1, n, c++); return\ try call nestpi(c11, 4) }
proposed
editing
editing
proposed
Kim Walisch, <a href="https://github.com/kimwalisch/primecount">Fast C++ prime counting function implementation (primecount)</a>.
a(n) = A00720(A101225(n)). - Amiram Eldar, Jun 29 2024
a(14)-a(24) from _using Kim Walisch's primecount added by _Amiram Eldar_, Jun 29 2024
a(n) = pi(pi(pi(pi(10^n)))) where pi(x) is the number of primes LE <= x.
a(10)-a(1413) from Robert G. Wilson v, Dec 21 2004
a(14)-a(24) from Amiram Eldar, Jun 29 2024
0, 2, 5, 14, 44, 165, 725, 3607, 19624, 115127, 716177, 4675144, 31743253, 222710685, 1606581461, 11868655658, 89506275569, 687275710608, 5361744667232, 42423406909091, 339921273158836, 2754682455861719, 22553369622588850, 186375668479844528
approved
editing