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 A066007 #14 Sep 26 2021 11:09:15
%S A066007 1,19,199,1099,10999,109999,1099999,10999999,109999999,1099999999,
%T A066007 10999999999,109999999999,1099999999999,10999999999999,
%U A066007 100999999999999,1009999999999999,10099999999999999,100999999999999999,1009999999999999999,10099999999999999999
%N A066007 a(n) is that n-digit number m which minimizes m/(sum of digits of m); in case of a tie pick the smallest.
%H A066007 S. W. Golomb, <a href="https://www.itsoc.org/sites/default/files/2021-03/itNL0901.pdf">Sums and products of digits</a>, IEEE Information Theory Society Newsletter, 51 (No. 3, Sept. 2001), p. 15.
%H A066007 S. W. Golomb, <a href="https://www.itsoc.org/publications/newsletters/march-2017-issue">Sums and Products of Digits Solutions</a>, IEEE Information Theory Society Newsletter, Vol. 67, No. 1, March 2017, p. 22. Reprint.
%F A066007 1 followed by 0's followed by 9's; the first time r 0's appear is at n = (10^r-1)/9+r+2.
%o A066007 (Python)
%o A066007 def k(r): return (10**r - 1)//9 + r + 2
%o A066007 def a(n):
%o A066007 r = 0
%o A066007 while k(r+1) <= n: r += 1
%o A066007 return int('1' + '0'*r + '9'*(n-r-1))
%o A066007 print([a(n) for n in range(1, 21)]) # _Michael S. Branicky_, Jan 19 2021
%Y A066007 Cf. A066008, A034726, A034727.
%K A066007 nonn,base,easy
%O A066007 1,2
%A A066007 _N. J. A. Sloane_, Dec 11 2001