|
%I #4 Jan 27 2018 18:23:38
%S 1,1,1,2,1,2,2,2,2,1,2,2,2,2,1,2,2,3,3,2,1,2,2,3,2,2,3,3,2,3,2,2,3,2,
%T 3,3,2,2,3,2,2,1,2,3,3,2,2,2,3,3,2,3,2,3,2,3,3,2,2,2,2,2,1,2,2,3,3,2,
%U 3,3,3,3,3,3,4,3,3,4,3,2,3,3,3,2,1,2
%N Number of distinct runs in base-4 digits of n.
%C Every positive integers occurs infinitely many times. See A297770 for a guide to related sequences.
%H Clark Kimberling, <a href="/A297772/b297772.txt">Table of n, a(n) for n = 1..10000</a>
%e 123456 in base-4: 1,3,2,0,2,1,0,0,0; seven runs, of which 5 are distinct, so that a(123456) = 5.
%t b = 4; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]]
%t Table[s[n], {n, 1, 200}]
%Y Cf. A043556 (number of runs, not necessarily distinct), A297770.
%K nonn,base,easy
%O 1,4
%A _Clark Kimberling_, Jan 27 2018
|
