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 A297774 #4 Feb 03 2018 16:38:02
%S A297774 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,
%T A297774 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,
%U A297774 3,3,2,2,3,2,3,3,3,3,2,2,3,3,3,2,2,1
%N A297774 Number of distinct runs in base-6 digits of n.
%C A297774 Every positive integers occurs infinitely many times. See A297770 for a guide to related sequences.
%H A297774 Clark Kimberling, <a href="/A297774/b297774.txt">Table of n, a(n) for n = 1..10000</a>
%e A297774 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.
%t A297774 b = 6; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]]
%t A297774 Table[s[n], {n, 1, 200}]
%Y A297774 Cf. A043558 (number of runs, not necessarily distinct), A297770.
%K A297774 nonn,base,easy
%O A297774 1,6
%A A297774 _Clark Kimberling_, Jan 27 2018