|
Search: id:A099204
|
|
|
| A099204 |
|
A variation on Flavius's sieve (A000960): Start with the natural numbers; at the k-th sieving step, remove every p-th term of the sequence remaining after the (k-1)-st sieving step, where p is the k-th prime; iterate. |
|
+0
6
|
|
| 1, 3, 7, 9, 15, 19, 25, 31, 33, 37, 45, 51, 61, 63, 67, 69, 81, 85, 97, 105, 109, 111, 123, 129, 135, 141, 145, 151, 159, 169, 183, 189, 195, 201, 211, 213, 219, 225, 229, 241, 261, 265, 273, 277, 289, 291, 307, 315, 319, 321, 325, 339, 351, 355, 361, 375, 381
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Index entries for sequences generated by sieves
|
|
EXAMPLE
|
Start with
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 ... and delete every second term, giving
1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 ... and delete every 3rd term, giving
1 3 7 9 13 15 19 21 25 27 ... and delete every 5th term, giving
1 3 7 9 15 19 21 25 ... and delete every 7th term, giving
.... Continue for ever and what's left is the sequence.
|
|
MAPLE
|
S[1]:={seq(i, i=1..390)}: for n from 2 to 390 do S[n]:=S[n-1] minus {seq(S[n-1][ithprime(n-1)*i], i=1..nops(S[n-1])/ithprime(n-1))} od: S[390]; - Emeric Deutsch (deutsch(AT)duke.poly.edu), Nov 17 2004
|
|
CROSSREFS
|
Cf. A000960, A099207, A099243.
Sequence in context: A026139 A119681 A104177 this_sequence A070993 A128539 A057463
Adjacent sequences: A099201 A099202 A099203 this_sequence A099205 A099206 A099207
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Nov 16 2004
|
|
EXTENSIONS
|
More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 16 2004
|
|
|
Search completed in 0.002 seconds
|
