This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A207472 #17 Aug 06 2023 03:06:47
%S A207472 5,26,33,62,66,93,96,127,135,152,163,188,192,223,225,254,270,273,294,
%T A207472 313,320,351,353,382,390,409,418,445,449,478,480,511,543,545,574,578,
%U A207472 605,608,639,647,664,675,700,704,735,737,766,782,785,806,825,832,863,865
%N A207472 Let a(1) = 5. 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)) = 5.
%C A207472 Odious and evil terms are alternating (cf. A000069, A001969).
%H A207472 Amiram Eldar, <a href="/A207472/b207472.txt">Table of n, a(n) for n = 1..10000</a>
%t A207472 a[1] = 5; a[n_] := a[n] = Module[{k = a[n - 1], m = a[n-1] + 1}, While[DigitCount[BitXor[k, m], 2, 1] != 5, m++]; m]; Array[a, 100] (* _Amiram Eldar_, Aug 06 2023 *)
%Y A207472 Cf. A000069, A000225, A001969, A205509, A205510, A205511, A205302, A205649, A205533, A122565, A206852, A206853, A206960, A207016, A207017.
%K A207472 nonn,base
%O A207472 1,1
%A A207472 _Vladimir Shevelev_, Feb 18 2012