A207460 - OEIS

A207460

Let a(1) = 4. For n > 1, a(n) is the least number greater than a(n-1) such that the Hamming distance D(a(n-1),a(n)) = 4.

4, 11, 16, 31, 35, 44, 49, 62, 70, 73, 82, 93, 97, 110, 112, 127, 143, 145, 158, 162, 173, 176, 191, 199, 200, 211, 220, 224, 239, 241, 254, 286, 290, 301, 304, 319, 327, 328, 339, 348, 352, 367, 369, 382, 398, 400, 415, 419

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

All terms are odious (A000069).

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..1000

MATHEMATICA

nxt[n_]:=Module[{k=n+1}, While[HammingDistance[PadLeft[IntegerDigits[ n, 2], IntegerLength[ k, 2]], IntegerDigits[k, 2]]!=4, k++]; k]; NestList[ nxt, 4, 50] (* Harvey P. Dale, Nov 07 2020 *)

CROSSREFS

Cf. A000225, A205509, A205510, A205511, A205302, 205649, A205533, A122565, A206852, A206853, A206960, A207016, A207017.

Sequence in context: A005224 A054870 A197567 * A107988 A038241 A360134

Adjacent sequences: A207457 A207458 A207459 * A207461 A207462 A207463

KEYWORD

nonn,base

AUTHOR

Vladimir Shevelev, Feb 18 2012

STATUS

approved