A145583
a(n) = number of numbers removed in the n-th step of Eratosthenes's sieve for 10^2.
Original entry on oeis.org
Artur Jasinski with assistance from Bob Hanlon (hanlonr(AT)cox.net), Oct 14 2008
Cf.
A006880,
A122121,
A145532,
A145533,
A145534,
A145535,
A145536,
A145537,
A145538,
A145539,
A145540,
A145583,
A145584,
A145585,
A145586,
A145587,
A145588,
A145589,
A145590,
A145591,
A145592.
-
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 = 2; kk = PrimePi[Sqrt[10^nn]]; t3 = f3[10^nn, kk] (*Bob Hanlon (hanlonr(AT)cox.net) *)
A145584
a(n) = number of numbers removed in step n of Eratosthenes's sieve for 2^6.
Original entry on oeis.org
Artur Jasinski with assistance from Bob Hanlon (hanlonr(AT)cox.net), Oct 14 2008
-
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 = 6; kk = PrimePi[Sqrt[2^nn]]; t3 = f3[2^nn, kk] (* Bob Hanlon (hanlonr(AT)cox.net) *)
Showing 1-2 of 2 results.
Comments