

A297771


Number of distinct runs in base3 digits of n.


3



1, 1, 2, 1, 2, 2, 2, 1, 2, 2, 3, 2, 1, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 1, 2, 2, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 2, 1, 2, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 2, 2, 2, 3, 2, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 2, 2, 3, 2, 3, 2, 3, 3, 3, 2, 3, 2, 2, 1, 2, 2, 3, 3, 3, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


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

1040 in base3: 1,1,0,2,1,1,2; five runs, of which 3 are distinct, so that a(1040) = 3.


MATHEMATICA

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


CROSSREFS

Cf. A043555 (number of runs, not necessarily distinct), A297770.
Sequence in context: A197775 A002321 A043530 * A164995 A294108 A055718
Adjacent sequences: A297768 A297769 A297770 * A297772 A297773 A297774


KEYWORD

nonn,base,easy


AUTHOR

Clark Kimberling, Jan 26 2018


STATUS

approved



