Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Apr 24 2021 01:59:31
%S 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 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 1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2
%N Number of runs in base-16 representation of n.
%C 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 Every positive integers occurs infinitely many times. See A297770 for a guide to related sequences. - _Clark Kimberling_, Feb 04 2018
%H Clark Kimberling, <a href="/A043568/b043568.txt">Table of n, a(n) for n = 0..10000</a>
%t b = 16; s[n_] := Length[Split[IntegerDigits[n, b]]];
%t Table[s[n], {n, 0, 200}]
%Y Cf. A297783 (number of distinct runs), A297770.
%K nonn,base
%O 0,17
%A _Clark Kimberling_