|
Search: id:A100586
|
|
|
| A100586 |
|
Write down the numbers from 3 to infinity. Take next number, M say, that has not been crossed off. Counting through the numbers that have not yet been crossed off after that M, cross off every 5-th term. Repeat, always crossing off every 5-th term of those that remain. The numbers that are left form the sequence. |
|
+0
2
|
|
| 3, 4, 5, 6, 7, 9, 11, 14, 17, 21, 26, 32, 40, 50, 62, 77, 96, 120, 150, 187, 234, 292, 365, 456, 570, 712, 890, 1112, 1390, 1737, 2171, 2714, 3392, 4240, 5300, 6625, 8281, 10351, 12939, 16174, 20217, 25271, 31589, 39486, 49357, 61696, 77120
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
"Sieves", Popular Computing (Calabasas, CA), Vol. 2 (No. 13, Apr 1974), pp. 6-7; sieve #6 (K=5).
|
|
LINKS
|
Index entries for sequences generated by sieves
|
|
MATHEMATICA
|
t = Range[3, 80000]; r = {}; While[Length[t] > 0, AppendTo[r, First[t]]; t = Drop[t, {1, -1, 5}]; ]; r - from Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 02 2004
|
|
CROSSREFS
|
Cf. A003309, A003310, A100464, A100562, A003312, A003311, A052548, A100585.
Adjacent sequences: A100583 A100584 A100585 this_sequence A100587 A100588 A100589
Sequence in context: A091815 A081692 A096515 this_sequence A139372 A128659 A022555
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Dec 01 2004
|
|
|
Search completed in 0.002 seconds
|
