|
%I #28 Aug 18 2020 10:39:22
%S 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 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 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 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 a(n) = 0 for all n > 8: see A049101. - _Robert Israel_, Aug 18 2020
%t Do[ k = n + 1; While[ k*n != Apply[Times, IntegerDigits[k]] Apply[Plus, IntegerDigits[k]], k++ ]; Print[k], {n, 0, 10} ]
%Y Cf. A007953 (sum of digits), A007954 (product of digits).
%Y Cf. A049101.
%K base,nonn
%O 0,1
%A _Robert G. Wilson v_, Dec 13 2001
%E Edited by _Robert Israel_, Aug 18 2020
|
