login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185192 Number of primes less than 2^n. 2
0, 2, 4, 6, 11, 18, 31, 54, 97, 172, 309, 564, 1028, 1900, 3512, 6542, 12251, 23000, 43390, 82025, 155611, 295947, 564163, 1077871, 2063689, 3957809, 7603553, 14630843, 28192750, 54400028, 105097565, 203280221 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

This sequence differs from A007053 in the offset and in that the latter includes 1 (since the prime 2 is equal to 2^1, not less than it).

Number of primes with at most n bits.

LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 1..81 [for attributions and related results, see A007053]

Wikipedia, Prime-counting function

FORMULA

a(n) = A000720(2^n - 1).

EXAMPLE

a(7) = 31 because prime(31) = 127, prime(32) = 131, and 127 < 2^7 < 131.

MATHEMATICA

PrimePi[2^Range[32] - 1] (* Alonso del Arte, May 05 2019 *)

PROG

(PARI) a(n)=primepi(2^n-1) \\ Charles R Greathouse IV, Dec 04 2014

CROSSREFS

Cf. A000720, A006880, A007053, A014234.

Sequence in context: A138688 A131298 A168445 * A007053 A005684 A260697

Adjacent sequences:  A185189 A185190 A185191 * A185193 A185194 A185195

KEYWORD

nonn,hard,changed

AUTHOR

Washington Bomfim, Jan 23 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 24 04:25 EDT 2019. Contains 323528 sequences. (Running on oeis4.)