This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A145586 a(n) = number of numbers removed in each step of Eratosthenes' sieve for 2^8. 0
 127, 42, 16, 8, 5, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Number of steps in Eratosthenes' sieve for 2^n is A060967(n). Number of primes less than 2^8 is equal = 2^8 - (sum all of numbers in this sequence) - 1 = A007053(8). 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 = 8; kk = PrimePi[Sqrt[2^nn]]; t3 = f3[2^nn, kk] (* Bob Hanlon (hanlonr(AT)cox.net), Oct 14 2008 *) CROSSREFS Cf. A006880, A122121, A145532-A145540, A145583-A145592. Sequence in context: A300785 A051335 A186995 * A180352 A217557 A320571 Adjacent sequences:  A145583 A145584 A145585 * A145587 A145588 A145589 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 14 09:41 EST 2019. Contains 329979 sequences. (Running on oeis4.)