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 A033714 #63 Dec 27 2024 13:00:45
%S A033714 1,10,190,2890,38890,488890,5888890,68888890,788888890,8888888890,
%T A033714 98888888890,1088888888890,11888888888890,128888888888890,
%U A033714 1388888888888890,14888888888888890,158888888888888890,1688888888888888890,17888888888888888890,188888888888888888890
%N A033714 Number of zeros in numbers 0 to 999..9 (n digits).
%C A033714 This sequence also gives the total count of digits of n below 10^n. In such counts it makes sense to omit 10^0 as we are interested in having ten digits under each power of 10. For each power of 10 the total number of digits 0-9 is always the total of zeros for the next power. For example, at 10^1 there is 1 of each numeral 0-9, total 10 digits. At 10^2, the number of zeros is 10, with 20 each for the other 9 numerals and so on. - _Enoch Haga_, May 13 2006
%C A033714 Also the position of 10^n in Champernowne's constant (A033307). See Sikora, p. 3. - _Robert G. Wilson v_, Jun 29 2014
%H A033714 Vincenzo Librandi, <a href="/A033714/b033714.txt">Table of n, a(n) for n = 1..100</a>
%H A033714 John K. Sikora, <a href="http://arxiv.org/abs/1210.1263">On the High Water Mark Convergents of Champernowne's Constant in Base Ten</a>, arXiv:1210.1263 [math.NT], 2012.
%H A033714 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (21,-120,100).
%F A033714 a(n) = 10^(n-1)*n - (1/9)*10^n + 10/9. - _Robert Israel_, Jun 30 2014
%F A033714 G.f.: -x*(100*x^2-11*x+1) / ((x-1)*(10*x-1)^2). - _Colin Barker_, Jan 27 2015
%F A033714 From _Bernard Schott_, Nov 20 2022: (Start)
%F A033714 a(n) = A033713(n) + 1.
%F A033714 a(n+1) = a(n) + 9 * A053541(n). (End)
%t A033714 a[1] = 1; a[n_] := a[n] = 9*10^(n-2)*(n-1) + a[n-1]; Table[a[n], {n, 1, 17}] (* _Jean-François Alcover_, Jul 13 2012 *)
%t A033714 f[n_] := 1 + Sum[9 m*10^(m - 1), {m, n}]; Array[f, 18, 0] (* _Robert G. Wilson v_, Jun 29 2014 *)
%t A033714 LinearRecurrence[{21,-120,100},{1,10,190},20] (* _Harvey P. Dale_, Dec 03 2021 *)
%o A033714 (Magma) [(9*n*10^n-10*10^n+100)/90: n in [1..20]]; // _Vincenzo Librandi_, Jul 01 2014
%o A033714 (PARI) Vec(-x*(100*x^2-11*x+1)/((x-1)*(10*x-1)^2) + O(x^100)) \\ _Colin Barker_, Jan 27 2015
%Y A033714 Cf. A033713, A053541.
%Y A033714 Cf. A212704 (first differences).
%K A033714 nonn,base,nice,easy
%O A033714 1,2
%A A033714 Olivier Gorin (gorin(AT)roazhon.inra.fr)
%E A033714 More terms from _Erich Friedman_