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 A043568 #13 Apr 24 2021 01:59:31
%S A043568 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%T A043568 1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%U A043568 1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2
%N A043568 Number of runs in base-16 representation of n.
%C A043568 Differs from A043543 if we consider for example numbers which are palindromic in base 16 with 3 (2 distinct) digits. - _R. J. Mathar_, Oct 20 2008
%C A043568 Every positive integers occurs infinitely many times. See A297770 for a guide to related sequences. - _Clark Kimberling_, Feb 04 2018
%H A043568 Clark Kimberling, <a href="/A043568/b043568.txt">Table of n, a(n) for n = 0..10000</a>
%t A043568 b = 16; s[n_] := Length[Split[IntegerDigits[n, b]]];
%t A043568 Table[s[n], {n, 0, 200}]
%Y A043568 Cf. A297783 (number of distinct runs), A297770.
%K A043568 nonn,base
%O A043568 0,17
%A A043568 _Clark Kimberling_