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 A066156 #28 Aug 18 2020 10:39:22
%S A066156 10,135,15,139968,18,756,476,0,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%T A066156 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%U A066156 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A066156 a(n) is the least k>n such that k*n = (product of digits of k) * (sum of digits of k), or 0 if no such k exists.
%C A066156 a(n) = 0 for all n > 8: see A049101. - _Robert Israel_, Aug 18 2020
%t A066156 Do[ k = n + 1; While[ k*n != Apply[Times, IntegerDigits[k]] Apply[Plus, IntegerDigits[k]], k++ ]; Print[k], {n, 0, 10} ]
%Y A066156 Cf. A007953 (sum of digits), A007954 (product of digits).
%Y A066156 Cf. A049101.
%K A066156 base,nonn
%O A066156 0,1
%A A066156 _Robert G. Wilson v_, Dec 13 2001
%E A066156 Edited by _Robert Israel_, Aug 18 2020