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, 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

Offset

1,1

Links

Table of n, a(n) for n=1..60.

Benoit Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.

Benoit Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, arXiv:math/0305308 [math.NT], 2003.

Crossrefs

Cf. A079000.

Sequence in context: A108311 A092767 A190000 * A248184 A156745 A087347

Adjacent sequences: A080750 A080751 A080752 * A080754 A080755 A080756

Keyword

easy,nonn

Author

Matthew Vandermast, Mar 08 2003

Status

approved