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,6

Comments

Every positive integers occurs infinitely many times. See A297770 for a guide to related sequences.

Links

Clark Kimberling, Table of n, a(n) for n = 1..10000

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

Adjacent sequences: A297771 A297772 A297773 * A297775 A297776 A297777

Keyword

nonn,base,easy

Author

Clark Kimberling, Jan 27 2018

Status

approved