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 A243198 #17 Jul 13 2014 02:31:14
%S A243198 5,91,919,7795,100000,1000000,10000000,100000000,1000000000,
%T A243198 9968647168,100000000000,1000000000000,9999761914432,100000000000000,
%U A243198 1000000000000000,10000000000000000,100000000000000000,1000000000000000000,9999982446427242496
%N A243198 Least number k such that k + DigProd(k) = 10^n.
%C A243198 a(n) <= 10^n for all n.
%H A243198 Hiroaki Yamanouchi, <a href="/A243198/b243198.txt">Table of n, a(n) for n = 1..50</a>
%e A243198 919 + 9*1*9 = 1000 = 10^3. Since 919 is the smallest number with this property, a(3) = 919.
%o A243198 (PARI) DP(n)={p=1;d=digits(n);return(prod(i=1,#d,d[i]))}
%o A243198 a(n)=for(k=10^n-9^n,10^n,if((k+DP(k))==10^n,return(k)))
%o A243198 n=1;while(n<100,print1(a(n),", ");n++)
%Y A243198 Cf. A007954, A242945.
%K A243198 nonn,base,hard
%O A243198 1,1
%A A243198 _Derek Orr_, Jun 01 2014
%E A243198 a(8)-a(19) from _Hiroaki Yamanouchi_, Jul 10 2014