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 A111896 #11 Dec 25 2019 08:33:46
%S A111896 0,0,0,0,0,0,0,0,0,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,3,3,
%T A111896 3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,5,5,5,5,
%U A111896 5,6,6,6,6,6,7,7,7,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8
%N A111896 Number of numbers m <= n such that 6 equals the second digit after decimal point of square root of n in decimal representation.
%C A111896 For n > 1: if A111862(n)=6 then a(n) = a(n-1) + 1, otherwise a(n) = a(n-1).
%C A111896 Lim_{n->infinity} a(n)/n = 1/10.
%D A111896 G. Pólya and G. Szegő, Problems and Theorems in Analysis I (Springer 1924, reprinted 1972), Part Two, Chap. 4, Sect. 4, Problem 178.
%e A111896 a(10) = 1, a(100) = 8, a(1000) = 98, a(10000) = 1000.
%t A111896 sd6Q[n_]:=Module[{c=RealDigits[Sqrt[n],10,10]},If[Drop[c[[1]],c[[2]]][[2]]==6,1,0]]; Accumulate[Array[sd6Q,110]] (* _Harvey P. Dale_, Aug 17 2012 *)
%Y A111896 Cf. A111862, A111890, A111891, A111892, A111893, A111894, A111895, A111897, A111898, A111899, A111856.
%K A111896 nonn,base
%O A111896 1,12
%A A111896 _Reinhard Zumkeller_, Aug 20 2005