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 A111890 #7 Dec 24 2019 21:42:29
%S A111890 1,1,1,2,2,2,2,2,3,3,3,3,4,4,4,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,
%T A111890 6,7,7,7,7,7,8,8,8,8,9,9,9,9,10,10,10,10,10,10,10,10,10,10,10,10,10,
%U A111890 10,10,11,11,11,11,11,12,12,12,12,12,13,13,13,13,13,13,13,14,14,14,14,14,14
%N A111890 Number of numbers m <= n such that 0 equals the second digit after decimal point of square root of n in decimal representation.
%C A111890 For n > 1: if A111862(n)=4 then a(n) = a(n-1) + 1, otherwise a(n) = a(n-1).
%C A111890 Lim_{n->infinity} a(n)/n = 1/10.
%D A111890 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 A111890 a(10) = 3, a(100) = 15, a(1000) = 104, a(10000) = 1006.
%Y A111890 Cf. A111891, A111892, A111893, A111894, A111895, A111896, A111897, A111898, A111899, A111850.
%K A111890 nonn,base
%O A111890 1,4
%A A111890 _Reinhard Zumkeller_, Aug 20 2005