|
Search: id:A086690
|
|
|
| A086690 |
|
Number of primes < 2^prime(n). |
|
+0
2
|
|
| 2, 4, 11, 31, 309, 1028, 12251, 43390, 564163, 28192750, 105097565, 5586502348, 80316571436, 305761713237, 4461632979717, 252252704148404, 14458792895301660, 55890484045084135, 3249254387052557215, 48995571600129458363, 190499823401327905601
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Tomas Oliveira e Silva, Tables of values of pi(x) and of pi2(x)
|
|
EXAMPLE
|
There are 11 primes < 2^5
|
|
MATHEMATICA
|
Table[ PrimePi[ 2^Prime[n]], {n, 1, 14}]
|
|
PROGRAM
|
(PARI) primesless2p(n) = \primes less than 2^p { forprime(x=2, n, y=pi(2^x); print1(y", "); ); print(); print(sr) } pi(n) = { c=0; forprime(x=2, n, c++); return(c) }
|
|
CROSSREFS
|
Cf. A007053.
Sequence in context: A123427 A123421 A123430 this_sequence A059305 A120848 A135339
Adjacent sequences: A086687 A086688 A086689 this_sequence A086691 A086692 A086693
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Jul 28 2003
|
|
EXTENSIONS
|
Extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 30 2003
Revised by Max Alekseyev (maxal(AT)cs.ucsd.edu), Jul 20 2007
|
|
|
Search completed in 0.002 seconds
|
