|
| |
|
|
A145591
|
|
a(n)=number of numbers removed in each step of Eratosthenes' sieve for 2^13
|
|
0
| |
|
|
4095, 1364, 545, 311, 170, 130, 91, 77, 63, 51, 46, 36, 34, 29, 26, 21, 17, 15, 12, 11, 9, 6, 3, 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^13 is equal = 2^13 - (sum all of numbers in this sequence) - 1 = A007053(13).
|
|
|
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 = 13; kk = PrimePi[Sqrt[2^nn]]; t3 = f3[2^nn, kk] (*Bob Hanlon*)
|
|
|
CROSSREFS
| A006880, A122121, A145532-A145540, A145583-A145592
Sequence in context: A126822 A063889 A024022 * A103289 A038463 A043452
Adjacent sequences: A145588 A145589 A145590 * A145592 A145593 A145594
|
|
|
KEYWORD
| fini,nonn
|
|
|
AUTHOR
| Artur Jasinski with assistence from Bob Hanlon (grafix(AT)csl.pl), Oct 14 2008
|
| |
|
|
