A297774 Number of distinct runs in base-6 digits of n.
1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 3, 3, 3, 3, 2, 1, 2, 2, 2, 2, 3, 2, 2, 3, 3, 3, 3, 2, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 2, 3, 2, 3, 3, 3, 3, 2, 2, 3, 3, 3, 2, 2, 1
Offset: 1
Examples
9^9 in base-6: 1,0,2,2,3,5,4,3,3,2,1,3; ten runs, of which 8 are distinct, so that a(9^9) = 8.
Links
- Clark Kimberling, Table of n, a(n) for n = 1..10000
Programs
-
Mathematica
b = 6; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]] Table[s[n], {n, 1, 200}]
Comments