|
Search: id:A100585
|
|
|
| A100585 |
|
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 4-th term. Repeat, always crossing off every 4-th term of those that remain. The numbers that are left form the sequence. |
|
+0
3
|
|
| 3, 4, 5, 6, 8, 10, 13, 17, 22, 29, 38, 50, 66, 88, 117, 156, 208, 277, 369, 492, 656, 874, 1165, 1553, 2070, 2760, 3680, 4906, 6541, 8721, 11628, 15504, 20672, 27562, 36749, 48998, 65330, 87106, 116141, 154854, 206472, 275296, 367061, 489414, 652552
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(n+1) = a(n) + floor(a(n)/3) - Ben Thurston (benthurston27(AT)yahoo.com), Jan 09 2008
|
|
REFERENCES
|
"Sieves", Popular Computing (Calabasas, CA), Vol. 2 (No. 13, Apr 1974), pp. 6-7; sieve #6 (K=4).
|
|
LINKS
|
Index entries for sequences generated by sieves
|
|
MATHEMATICA
|
t = Range[3, 2500000]; r = {}; While[Length[t] > 0, AppendTo[r, First[t]]; t = Drop[t, {1, -1, 4}]; ]; r (Chandler)
|
|
CROSSREFS
|
Cf. A003309, A003310, A100464, A100562, A003312, A003311, A052548, A100586.
Sequence in context: A062514 A065875 A167057 this_sequence A023367 A047426 A026487
Adjacent sequences: A100582 A100583 A100584 this_sequence A100586 A100587 A100588
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Dec 01 2004
|
|
EXTENSIONS
|
More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 02 2004
|
|
|
Search completed in 0.002 seconds
|
