A297781 Number of distinct runs in base-13 digits of n.

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, 1, 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, 1, 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, 1, 2, 2

Offset

1,13

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

5200468 in base-13: 1,1,0,1,1,0,0; four runs, of which 3 are distinct, so that a(5200468) = 3.

Mathematica

b = 13; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]]
Table[s[n], {n, 1, 200}]

Crossrefs

Cf. A043565 (number of runs, not necessarily distinct), A297770.

Sequence in context: A297780 A043564 A043539 * A043565 A043540 A297782

Adjacent sequences: A297778 A297779 A297780 * A297782 A297783 A297784

Keyword

nonn,base,easy

Author

Clark Kimberling, Feb 03 2018

Status

approved