%I
%S 1,1,1,1,1,1,1,2,1,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,
%T 2,1,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,1,2,2,3,3,3,
%U 3,3,3,2,1,2,2,2,2,2,2,3,2,2,3,3,3,3
%N Number of distinct runs in base8 digits of n.
%C Every positive integers occurs infinitely many times. See A297770 for a guide to related sequences.
%H Clark Kimberling, <a href="/A297776/b297776.txt">Table of n, a(n) for n = 1..10000</a>
%e 1262656 in base8: 1,0,0,1,0,0,1; five runs, of which 2 are distinct, so that a(1262656) = 2.
%t b = 8; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]]
%t Table[s[n], {n, 1, 200}]
%Y Cf. A043560 (number of runs, not necessarily distinct), A297770, A043535.
%K nonn,base,easy
%O 1,8
%A _Clark Kimberling_, Jan 29 2018
