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 A297776 #7 Feb 02 2018 03:53:36
%S A297776 1,1,1,1,1,1,1,2,1,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,
%T A297776 2,1,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,1,2,2,3,3,3,
%U A297776 3,3,3,2,1,2,2,2,2,2,2,3,2,2,3,3,3,3
%N A297776 Number of distinct runs in base-8 digits of n.
%C A297776 Every positive integers occurs infinitely many times. See A297770 for a guide to related sequences.
%H A297776 Clark Kimberling, <a href="/A297776/b297776.txt">Table of n, a(n) for n = 1..10000</a>
%e A297776 1262656 in base-8: 1,0,0,1,0,0,1; five runs, of which 2 are distinct, so that a(1262656) = 2.
%t A297776 b = 8; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]]
%t A297776 Table[s[n], {n, 1, 200}]
%Y A297776 Cf. A043560 (number of runs, not necessarily distinct), A297770, A043535.
%K A297776 nonn,base,easy
%O A297776 1,8
%A A297776 _Clark Kimberling_, Jan 29 2018