cp's OEIS Frontend

A062043 Positive numbers whose product of digits is 10 times their sum.

%I A062043 #26 Aug 09 2025 07:38:13
%S A062043 459,495,549,594,945,954,1566,1656,1665,2259,2295,2355,2529,2535,2553,
%T A062043 2592,2925,2952,3255,3525,3552,5166,5229,5235,5253,5292,5325,5352,
%U A062043 5523,5532,5616,5661,5922,6156,6165,6516,6561,6615,6651,9225,9252,9522
%N A062043 Positive numbers whose product of digits is 10 times their sum.
%C A062043 A subsequence of A011535 as each term must include the digit 5. - _Chai Wah Wu_, Dec 09 2015
%H A062043 Harry J. Smith, <a href="/A062043/b062043.txt">Table of n, a(n) for n = 1..500</a>
%e A062043 594 belongs to the sequence as (5*9*4)/(5+9+4) = 180/18 = 10.
%p A062043 filter:= proc(t) local L;
%p A062043   L:= convert(t,base,10);
%p A062043   convert(L,`*`) = 10*convert(L,`+`)
%p A062043 end proc:
%p A062043 select(filter, [$1..10^5]); # _Robert Israel_, Sep 11 2022
%t A062043 Select[Range[10000], Times @@ IntegerDigits[ # ] == 10 Plus @@ IntegerDigits[ # ] &] (* _Tanya Khovanova_, Dec 25 2006 *)
%o A062043 (PARI) isok(n) = my(d=digits(n)); vecprod(d)==10*vecsum(d) \\ _Mohammed Yaseen_, Sep 11 2022
%o A062043 (Python)
%o A062043 from math import prod
%o A062043 def ok(n): d = list(map(int, str(n))); return prod(d) == 10*sum(d)
%o A062043 print([k for k in range(1, 9999) if ok(k)]) # _Michael S. Branicky_, Sep 11 2022
%Y A062043 Cf. A011540, A034710, A062034, A062035, A062036, A062382, A062037, A062384, A062040, A062041, A062045.
%Y A062043 Cf. A011535, A124694.
%K A062043 nonn,base,easy
%O A062043 1,1
%A A062043 _Amarnath Murthy_, Jun 28 2001
%E A062043 More terms from _Harvey P. Dale_ and Larry Reeves (larryr(AT)acm.org), Jul 06 2001