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.

A111892 Number of numbers m <= n such that 2 equals the second digit after decimal point of square root of n in decimal representation.

This page as a plain text file.
%I A111892 #13 Nov 22 2021 15:28:58
%S A111892 0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%T A111892 2,2,2,2,2,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,5,5,5,
%U A111892 5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7
%N A111892 Number of numbers m <= n such that 2 equals the second digit after decimal point of square root of n in decimal representation.
%C A111892 For n > 1: if A111862(n)=2 then a(n) = a(n-1) + 1, otherwise a(n) = a(n-1).
%C A111892 Lim_{n->infinity} a(n)/n = 1/10.
%D A111892 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 A111892 Harvey P. Dale, <a href="/A111892/b111892.txt">Table of n, a(n) for n = 1..1000</a>
%e A111892 a(10) = 1, a(100) = 7, a(1000) = 95, a(10000) = 1000.
%t A111892 Accumulate[Table[If[NumberDigit[Sqrt[n],-2]==2,1,0],{n,110}]] (* _Harvey P. Dale_, Nov 22 2021 *)
%Y A111892 Cf. A111862, A111890, A111891, A111893, A111894, A111895, A111896, A111897, A111898, A111899, A111852.
%K A111892 nonn,base
%O A111892 1,17
%A A111892 _Reinhard Zumkeller_, Aug 20 2005