|
Search: id:A086692
|
|
|
| A086692 |
|
Number of primes < 3^prime(n). |
|
+0
1
|
| |
|
|
OFFSET
|
2,1
|
|
|
EXAMPLE
|
There are 4 primes < 3^2
|
|
PROGRAM
|
(PARI) primesless3p(n) = \primes less than 3^p { forprime(x=2, n, y=pi(3^x); print1(y", "); ); print(); print(sr) } pi(n) = { c=0; forprime(x=2, n, c++); return(c) }
|
|
CROSSREFS
|
Adjacent sequences: A086689 A086690 A086691 this_sequence A086693 A086694 A086695
Sequence in context: A030694 A060998 A009276 this_sequence A069507 A013571 A002942
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Jul 28 2003
|
|
|
Search completed in 0.002 seconds
|
