|
%I #6 Jul 24 2023 11:41:39
%S 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,1,2,2,
%T 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,1,2,2,2,2,
%U 2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2
%N Number of distinct runs in base-15 digits of n.
%C Every positive integers occurs infinitely many times. See A297770 for a guide to related sequences.
%C Starts to differ from A043542 at n=3391. - _R. J. Mathar_, Jul 24 2023
%H Clark Kimberling, <a href="/A297783/b297783.txt">Table of n, a(n) for n = 1..10000</a>
%e 12153600 in base-15: 1,1,0,1,1,0,0; four runs, of which 3 are distinct, so that a(12153600) = 3.
%t b = 15; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]]
%t Table[s[n], {n, 1, 200}]
%Y Cf. A043567 (number of runs, not necessarily distinct), A297770.
%K nonn,base,easy
%O 1,15
%A _Clark Kimberling_, Feb 03 2018
|
