cp's OEIS Frontend

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.

A111850 Number of numbers m <= n such that 0 equals the first digit after decimal point of square root of n in decimal representation.

This page as a plain text file.
%I A111850 #10 Dec 24 2019 21:41:25
%S A111850 1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,5,6,6,6,6,6,6,6,6,6,
%T A111850 6,7,8,8,8,8,8,8,8,8,8,8,8,8,9,10,10,10,10,10,10,10,10,10,10,10,10,10,
%U A111850 10,11,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,13,14,14,14,14,14
%N A111850 Number of numbers m <= n such that 0 equals the first digit after decimal point of square root of n in decimal representation.
%C A111850 For n > 1: if A023961(n)=0 then a(n) = a(n-1) + 1, otherwise a(n) = a(n-1).
%C A111850 Lim_{n->infinity} a(n)/n = 1/10.
%D A111850 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 A111850 a(10) = 3, a(100) = 15, a(1000) = 118, a(10000) = 1050.
%t A111850 zd[n_]:=Module[{c=RealDigits[Sqrt[n],10,10],f},f=Last[c]+1;If[First[c][[f]]==0,1,0]]; Accumulate[Array[zd,90]] (* _Harvey P. Dale_, Feb 01 2012 *)
%Y A111850 Cf. A111851, A111852, A111853, A111854, A111855, A111856, A111857, A111858, A111859, A111890.
%K A111850 nonn,base
%O A111850 1,4
%A A111850 _Reinhard Zumkeller_, Aug 20 2005