

A297772


Number of distinct runs in base4 digits of n.


3



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



OFFSET

1,4


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

123456 in base4: 1,3,2,0,2,1,0,0,0; seven runs, of which 5 are distinct, so that a(123456) = 5.


MATHEMATICA

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


CROSSREFS

Cf. A043556 (number of runs, not necessarily distinct), A297770.
Sequence in context: A219025 A270746 A043531 * A043556 A230643 A163367
Adjacent sequences: A297769 A297770 A297771 * A297773 A297774 A297775


KEYWORD

nonn,base,easy


AUTHOR

Clark Kimberling, Jan 27 2018


STATUS

approved



