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 A062382 #18 Aug 02 2022 15:41:35 %S A062382 257,275,345,354,435,453,527,534,543,572,725,752,1258,1285,1528,1582, %T A062382 1825,1852,2158,2185,2235,2253,2325,2352,2518,2523,2532,2581,2815, %U A062382 2851,3225,3252,3522,5128,5182,5218,5223,5232,5281,5322,5812,5821,8125,8152 %N A062382 Positive numbers whose product of digits is 5 times their sum. %H A062382 Harry J. Smith, <a href="/A062382/b062382.txt">Table of n, a(n) for n = 1..500</a> %e A062382 2235 belongs to the sequence as (2*2*3*5)/(2+2+3+5) = 60/12 = 5. %t A062382 Select[Range[9000],Times@@IntegerDigits[#]==5*Total[IntegerDigits[#]]&] (* _Harvey P. Dale_, Mar 01 2012 *) %o A062382 (PARI) isok(n) = my(d=digits(n)); vecprod(d)==5*vecsum(d) \\ _Mohammed Yaseen_, Aug 02 2022 %o A062382 (Python) %o A062382 from math import prod %o A062382 def ok(n): d = list(map(int, str(n))); return prod(d) == 5*sum(d) %o A062382 print([k for k in range(1, 9000) if ok(k)]) # _Michael S. Branicky_, Aug 02 2022 %Y A062382 Cf. A011540, A034710, A062034, A062035, A062036, A062037, A062384, A062040, A062041, A062043, A062045. %K A062382 nonn,base,easy %O A062382 1,1 %A A062382 _Amarnath Murthy_, Jun 27 2001 %E A062382 More terms from Larry Reeves (larryr(AT)acm.org), Jul 06 2001 %E A062382 Offset corrected by _Mohammed Yaseen_, Aug 02 2022