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 A111858 #15 May 17 2024 19:49:03
%S A111858 0,0,0,0,0,0,0,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,4,
%T A111858 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,6,7,7,7,7,7,7,7,
%U A111858 7,7,7,7,7,7,7,7,7,8,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,10,11,11,11,11,11
%N A111858 Number of numbers m <= n such that 8 equals the first digit after decimal point of square root of n in decimal representation.
%D A111858 G. Pólya and G. Szegő, Problems and Theorems in Analysis I (Springer 1924, reprinted 1972), Part Two, Chap. 4, Sect. 4, Problem 178.
%H A111858 Paolo Xausa, <a href="/A111858/b111858.txt">Table of n, a(n) for n = 1..10000</a>
%F A111858 For n > 1: if A023961(n) = 8 then a(n) = a(n-1) + 1, otherwise a(n) = a(n-1).
%F A111858 Limit_{n->oo} a(n)/n = 1/10.
%e A111858 a(10) = 1, a(100) = 11, a(1000) = 99, a(10000) = 1010.
%t A111858 Accumulate[Array[Boole[Mod[Floor[10*Sqrt[#]], 10] == 8] &, 100]] (* _Paolo Xausa_, May 17 2024 *)
%Y A111858 Cf. A023961, A111850, A111851, A111852, A111853, A111854, A111855, A111856, A111857, A111859, A111898.
%K A111858 nonn,base
%O A111858 1,15
%A A111858 _Reinhard Zumkeller_, Aug 20 2005