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 A033014 #28 Aug 06 2024 21:22:08
%S A033014 17,34,51,68,85,102,119,136,153,170,187,204,221,238,255,4352,4386,
%T A033014 4403,4420,4437,4454,4471,4488,4505,4522,4539,4556,4573,4590,4607,
%U A033014 8704,8721,8755,8772,8789,8806,8823,8840,8857,8874
%N A033014 Every run of digits of n in base 16 has length 2.
%H A033014 Vincenzo Librandi, <a href="/A033014/b033014.txt">Table of n, a(n) for n = 1..2000</a>
%F A033014 a(n) = 17*A043320(n) (= 17n for n<16, cf Example). - _M. F. Hasler_, Feb 02 2014
%e A033014 In base 16, a(1)=17 is written 11; the subsequent 14 values are the multiples of 17, corresponding to 22, 33, 44, ..., FF.
%e A033014 This is followed by a(16) = 4352 = 1100[16], then (still in base 16): 1122, 1133,..., 11FF, 2200, 2211, 2233, etc...
%t A033014 Select[Range[9000],Union[Length/@Split[IntegerDigits[#,16]]]=={2}&] (* _Harvey P. Dale_, Jan 19 2013 *)
%o A033014 (Python)
%o A033014 from itertools import count, islice, groupby
%o A033014 def A033014_gen(startvalue=1): # generator of terms >= startvalue
%o A033014 return filter(lambda n:set(len(list(g)) for k, g in groupby(hex(n)[2:]))=={2},count(max(startvalue,1)))
%o A033014 A033014_list = list(islice(A033014_gen(),20)) # _Chai Wah Wu_, Mar 10 2023
%Y A033014 See A033001 for further cross-references.
%K A033014 nonn,base
%O A033014 1,1
%A A033014 _Clark Kimberling_