|
| |
|
|
A145592
|
|
a(n)=number of numbers removed in each step of Eratosthenes' sieve for 2^14
|
|
10
| |
|
|
8191, 2730, 1091, 623, 340, 260, 182, 154, 121, 94, 89, 74, 66, 62, 55, 48, 43, 39, 35, 31, 28, 25, 23, 19, 15, 12, 11, 9, 7, 5, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Number of steps in Eratosthenes' sieve for 2^n is A060967(n).
Number of primes less than 2^14 is equal = 2^14 - (sum all of numbers in this sequence) - 1 = A007053(14).
|
|
|
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 = 14; kk = PrimePi[Sqrt[2^nn]]; t3 = f3[2^nn, kk] (*Bob Hanlon*)
|
|
|
CROSSREFS
| A006880, A122121, A145532-A145540, A145583-A145592
Sequence in context: A137385 A108093 A051334 * A172315 A103902 A075960
Adjacent sequences: A145589 A145590 A145591 * A145593 A145594 A145595
|
|
|
KEYWORD
| fini,full,nonn
|
|
|
AUTHOR
| Artur Jasinski with assistence from Bob Hanlon (grafix(AT)csl.pl), Oct 14 2008
|
| |
|
|
