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 A111859 #17 May 17 2024 19:48:55
%S A111859 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%T A111859 1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,
%U A111859 3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5
%N A111859 Number of numbers m <= n such that 9 equals the first digit after decimal point of square root of n in decimal representation.
%D A111859 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 A111859 Paolo Xausa, <a href="/A111859/b111859.txt">Table of n, a(n) for n = 1..10000</a>
%F A111859 For n > 1: if A023961(n) = 9 then a(n) = a(n-1) + 1, otherwise a(n) = a(n-1).
%F A111859 Limit_{n->oo} a(n)/n = 1/10.
%e A111859 a(10) = 0, a(100) = 5, a(1000) = 81, a(10000) = 950.
%t A111859 Accumulate[Array[Boole[Mod[Floor[10*Sqrt[#]], 10] == 9] &, 100]] (* _Paolo Xausa_, May 17 2024 *)
%Y A111859 Cf. A023961, A111850, A111851, A111852, A111853, A111854, A111855, A111856, A111857, A111858, A111899.
%K A111859 nonn,base
%O A111859 1,48
%A A111859 _Reinhard Zumkeller_, Aug 20 2005