|
Search: id:A086693
|
|
|
| A086693 |
|
Number of primes < p^p where p is prime. |
|
+0
1
|
| |
|
|
OFFSET
|
2,1
|
|
|
EXAMPLE
|
There are 9 primes < 3^3 = 27, namely 2,3,5,7,11,13,17,19,23.
|
|
PROGRAM
|
(PARI) primeslesspp(n) = \primes less than p^p { forprime(x=2, n, y=pi(x^x); print1(y", "); ); } pi(n) = { c=0; forprime(x=2, n, c++); return(c) }
|
|
CROSSREFS
|
Sequence in context: A049299 A024225 A000883 this_sequence A085605 A036878 A162710
Adjacent sequences: A086690 A086691 A086692 this_sequence A086694 A086695 A086696
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Jul 28 2003
|
|
|
Search completed in 0.002 seconds
|
