|
Search: id:A145537
|
|
|
| A145537 |
|
a(n)=number of numbers removed in each step of Eratosthenes' sieve for 10! |
|
+0
2
|
|
| 1814399, 604799, 241919, 138239, 75402, 58003, 40941, 34478, 26982, 20473, 18496, 15008, 13184, 12266, 10957, 9492, 8342, 7920, 7057, 6538, 6248, 5667, 5317, 4874, 4414, 4181, 4057, 3866, 3752, 3582, 3166, 3054, 2911, 2856, 2675, 2640, 2544, 2455
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Number of steps in Eratosthenes' sieve for n! is A133228(n).
Number of primes less than 10! is equal = 10!-(sum all numbers in this sequence)-1 = A003604(10).
|
|
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 = 10; kk = PrimePi[Sqrt[nn! ]]; t3 = f3[nn!, kk] (*Bob Hanlon*)
|
|
CROSSREFS
|
A003604, A133228, A145532-A145540
Sequence in context: A043650 A140861 A137819 this_sequence A147525 A115495 A015347
Adjacent sequences: A145534 A145535 A145536 this_sequence A145538 A145539 A145540
|
|
KEYWORD
|
fini,nonn
|
|
AUTHOR
|
Artur Jasinski with assistence from Bob Hanlon (grafix(AT)csl.pl), Oct 14 2008
|
|
|
Search completed in 0.002 seconds
|
