|
| |
|
|
A080753
|
|
a(1)=2; for n > 1, a is the second-smallest positive integer greater than a(n-1) such that the condition "n is in the sequence if and only if a(n) is odd" is satisfied.
|
|
2
| |
|
|
2, 5, 8, 12, 15, 18, 22, 25, 28, 32, 36, 39, 42, 46, 49, 52, 56, 59, 62, 66, 70, 73, 76, 80, 83, 86, 90, 93, 96, 100, 104, 107, 110, 114, 118, 121, 124, 128, 131, 134, 138, 141, 144, 148, 152, 155, 158, 162, 165, 168, 172, 175, 178, 182, 186, 189, 192, 196, 199, 202
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
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)
|
|
|
CROSSREFS
| Cf. A079000.
Sequence in context: A108311 A092767 A190000 * A156745 A087347 A062468
Adjacent sequences: A080750 A080751 A080752 * A080754 A080755 A080756
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Matthew Vandermast (ghodges14(AT)comcast.net), Mar 08 2003
|
| |
|
|
