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!)
A145590 a(n)=number of numbers removed in each step of Eratosthenes's sieve for 2^12. 2
2047, 682, 272, 155, 83, 65, 46, 40, 32, 25, 22, 18, 13, 11, 9, 6, 3, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Number of steps in Eratosthenes's sieve for 2^n is A060967(n).
Number of primes less than 2^12 is equal to 2^12 - (sum all of numbers in this sequence) - 1 = A007053(12).
LINKS
MATHEMATICA
f3[k_Integer?Positive, i_Integer?Positive] := Module[{f, m, r, p}, p = Transpose[{r = Range[2, i], Prime[r]}]; f[x_] := Catch[Fold[If[Mod[x, #2[[2]]] == 0, Throw[m[ #2[[1]]] = m[ #2[[1]]] + 1], #1] &, If[Mod[x, 2] == 0, Throw[m[1] = m[1] + 1]], p]]; Table[m[n] = -1, {n, i}]; f /@ Range[k]; Table[m[n], {n, i}]]; nn = 12; kk = PrimePi[Sqrt[2^nn]]; t3 = f3[2^nn, kk] (* Bob Hanlon (hanlonr(AT)cox.net) *)
CROSSREFS
Sequence in context: A024021 A370685 A298756 * A241039 A278353 A038462
KEYWORD
fini,nonn
AUTHOR
Artur Jasinski with assistance from Bob Hanlon (hanlonr(AT)cox.net), Oct 14 2008
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 March 29 08:13 EDT 2024. Contains 371265 sequences. (Running on oeis4.)