login
A297774
Number of distinct runs in base-6 digits of n.
3
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,6
COMMENTS
Every positive integers occurs infinitely many times. See A297770 for a guide to related sequences.
LINKS
EXAMPLE
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.
MATHEMATICA
b = 6; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]]
Table[s[n], {n, 1, 200}]
CROSSREFS
Cf. A043558 (number of runs, not necessarily distinct), A297770.
Sequence in context: A246920 A244964 A096993 * A043533 A043558 A307359
KEYWORD
nonn,base,easy
AUTHOR
Clark Kimberling, Jan 27 2018
STATUS
approved