login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086690 Number of primes < 2^prime(n). 2
2, 4, 11, 31, 309, 1028, 12251, 43390, 564163, 28192750, 105097565, 5586502348, 80316571436, 305761713237, 4461632979717, 252252704148404, 14458792895301660, 55890484045084135, 3249254387052557215, 48995571600129458363, 190499823401327905601 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = A007053(A000040(n)).
EXAMPLE
There are 11 primes < 2^5.
MATHEMATICA
Table[ PrimePi[ 2^Prime[n]], {n, 1, 14}]
PROG
(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 * A059305 A191586 A120848
KEYWORD
nonn
AUTHOR
Cino Hilliard, Jul 28 2003
EXTENSIONS
Extended by Robert G. Wilson v, Jul 30 2003
Revised by Max Alekseyev, Jul 20 2007
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 10:28 EDT 2024. Contains 371779 sequences. (Running on oeis4.)