|
Search: id:A080029
|
|
|
| A080029 |
|
a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is a multiple of 3". |
|
+0
5
|
|
| 0, 2, 3, 6, 5, 9, 12, 8, 15, 18, 11, 21, 24, 14, 27, 30, 17, 33, 36, 20, 39, 42, 23, 45, 48, 26, 51, 54, 29, 57, 60, 32, 63, 66, 35, 69, 72, 38, 75, 78, 41, 81, 84, 44, 87, 90, 47, 93, 96, 50, 99, 102, 53, 105, 108, 56, 111, 114, 59, 117, 120, 62, 123, 126, 65, 129, 132, 68
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)
|
|
FORMULA
|
a(3m)=6m, a(3m+1)=3m+2, a(3m+2)=6m+3.
|
|
CROSSREFS
|
Cf. A079000, A079313, A080030, A080031.
Sequence in context: A035493 A070038 A119790 this_sequence A091239 A145110 A043547
Adjacent sequences: A080026 A080027 A080028 this_sequence A080030 A080031 A080032
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mar 14 2003
|
|
EXTENSIONS
|
More terms from Matthew Vandermast (ghodges14(AT)comcast.net), Mar 20 2003
|
|
|
Search completed in 0.002 seconds
|
