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