This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A297773 #11 Feb 02 2018 03:53:18
%S A297773 1,1,1,1,2,1,2,2,2,2,2,1,2,2,2,2,2,1,2,2,2,2,2,1,2,2,3,3,3,2,1,2,2,2,
%T A297773 3,2,2,3,3,3,2,3,2,3,3,2,3,3,2,2,3,2,3,3,3,2,2,3,3,2,2,1,2,2,3,3,2,2,
%U A297773 3,3,3,2,3,2,2,3,3,2,3,3,2,3,2,3,3,3
%N A297773 Number of distinct runs in base-5 digits of n.
%C A297773 Every positive integers occurs infinitely many times. See A297770 for a guide to related sequences.
%H A297773 Clark Kimberling, <a href="/A297773/b297773.txt">Table of n, a(n) for n = 1..10000</a>
%e A297773 8^8 in base 5: 1,3,2,4,3,3,3,2,3,3,1; eight runs, of which 6 are distinct, so that a(8^8) = 6.
%t A297773 b = 5; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]]
%t A297773 Table[s[n], {n, 1, 200}]
%Y A297773 Cf. A043557 (number of runs, not necessarily distinct), A297770, A043532.
%K A297773 nonn,base,easy
%O A297773 1,5
%A A297773 _Clark Kimberling_, Jan 27 2018