A079259 a(n) is taken to be the smallest positive integer greater than a(n-1) such that the condition "n is in the sequence if and only if a(n) and a(n+1) are both odd" can be satisfied.

1, 5, 6, 10, 11, 15, 19, 20, 24, 25, 29, 33, 34, 38, 39, 43, 44, 48, 49, 53, 57, 58, 62, 63, 67, 71, 72, 76, 77, 81, 82, 86, 87, 91, 95, 96, 100, 101, 105, 109, 110, 114, 115, 119, 123, 124, 128, 129, 133, 137, 138, 142, 143, 147, 148, 152, 153, 157, 161, 162, 166, 167, 171, 175, 176, 180, 181, 185, 186, 190, 191, 195, 199, 200, 204

Offset

1,2

Links

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

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, A079253-A079258.

Sequence in context: A067612 A064957 A008851 * A275018 A029772 A046827

Adjacent sequences: A079256 A079257 A079258 * A079260 A079261 A079262

Keyword

easy,nonn

Author

N. J. A. Sloane and Matthew Vandermast, Feb 04 2003

Status

approved