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 A083377 #25 Sep 08 2022 08:45:10 %S A083377 1,4,14,44,141,447,1414,4472,14142,44721,141421,447213,1414213, %T A083377 4472135,14142135,44721359,141421356,447213595,1414213562,4472135954, %U A083377 14142135623,44721359549,141421356237,447213595499,1414213562373,4472135954999 %N A083377 a(n) = the largest integer whose square has n digits and first digit 1. %H A083377 Vincenzo Librandi, <a href="/A083377/b083377.txt">Table of n, a(n) for n = 1..1000</a> %H A083377 W. Hürlimann, <a href="http://www.ijpam.eu/contents/2004-11-1/4/4.pdf">Integer powers and Benford's law</a>, International Journal of Pure and Applied Mathematics, vol. 11, no. 1, pp. 39-46, 2004. %H A083377 <a href="/index/Be#Benford">Index entries for sequences related to Benford's law</a> %F A083377 a(n) = floor(sqrt(10^n/5)). %o A083377 (Magma) [Floor(Sqrt(10^n/5)) : n in [1..30]]; // _Vincenzo Librandi_, Oct 01 2011 %Y A083377 Cf. A049416, A083378, A083379, A083380. %K A083377 base,easy,nonn %O A083377 1,2 %A A083377 Werner S. Hürlimann (whurlimann(AT)bluewin.ch), Jun 05 2003 %E A083377 Edited by _Don Reble_, Nov 05 2005 %E A083377 Reference fixed by _Charles R Greathouse IV_, Oct 30 2009 %E A083377 More terms from _Vincenzo Librandi_, Oct 01 2011