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 A102677 #24 Feb 02 2023 08:35:33
%S A102677 0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,0,0,0,
%T A102677 0,0,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,2,2,
%U A102677 2,2,1,1,1,1,1,1,2,2,2,2,1,1,1,1,1,1,2,2,2,2,1,1,1,1,1,1,2,2,2,2,0,0,0,0,0
%N A102677 Number of digits >= 6 in decimal representation of n.
%C A102677 a(n) = 0 iff n is in A007092 (numbers in base 6). - _Bernard Schott_, Feb 02 2023
%H A102677 Hieronymus Fischer, <a href="/A102677/b102677.txt">Table of n, a(n) for n = 0..10000</a>
%F A102677 From _Hieronymus Fischer_, Jun 10 2012: (Start)
%F A102677 a(n) = Sum_{j=1..m+1} (floor(n/10^j + 2/5) - floor(n/10^j)), where m = floor(log_10(n)).
%F A102677 G.f.: g(x) = (1/(1-x))*Sum_{j>=0} (x^(6*10^j) - x^(10*10^j))/(1-x^10^(j+1)). (End)
%p A102677 p:=proc(n) local b,ct,j: b:=convert(n,base,10): ct:=0: for j from 1 to nops(b) do if b[j]>=6 then ct:=ct+1 else ct:=ct fi od: ct: end: seq(p(n),n=0..116); # _Emeric Deutsch_, Feb 23 2005
%t A102677 Table[Total@ Take[Most@ DigitCount@ n, -4], {n, 0, 104}] (* _Michael De Vlieger_, Aug 17 2017 *)
%Y A102677 Cf. A007092, A027868, A054899, A055640, A055641, A102669-A102685, A117804, A122840, A122841, A160093, A160094, A196563, A196564. Partial sums see A102678.
%Y A102677 Cf. A000120, A000788, A023416, A059015 (for base 2).
%K A102677 nonn,base,easy
%O A102677 0,67
%A A102677 _N. J. A. Sloane_, Feb 03 2005
%E A102677 More terms from _Emeric Deutsch_, Feb 23 2005