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 A062037 #15 Sep 09 2022 06:55:49
%S A062037 268,286,347,374,437,473,628,682,734,743,826,862,1269,1296,1348,1356,
%T A062037 1365,1384,1438,1483,1536,1563,1629,1635,1653,1692,1834,1843,1926,
%U A062037 1962,2169,2196,2237,2273,2327,2334,2343,2372,2433,2619,2691,2723,2732,2916
%N A062037 Positive numbers whose product of digits is 6 times their sum.
%H A062037 Harry J. Smith, <a href="/A062037/b062037.txt">Table of n, a(n) for n = 1..500</a>
%e A062037 2237 belongs to the sequence as (2*2*3*7)/(2+2+3+7) = 84/14 = 6.
%t A062037 p6sQ[n_]:=Module[{idn=IntegerDigits[n]},Times@@idn==6*Total[idn]]; Select[ Range[ 3000],p6sQ] (* _Harvey P. Dale_, Aug 17 2014 *)
%o A062037 (PARI) isok(n) = my(d=digits(n)); vecprod(d)==6*vecsum(d) \\ _Mohammed Yaseen_, Aug 02 2022
%o A062037 (Python)
%o A062037 from math import prod
%o A062037 def ok(n): d = list(map(int, str(n))); return prod(d) == 6*sum(d)
%o A062037 print([k for k in range(1, 3000) if ok(k)]) # _Michael S. Branicky_, Aug 02 2022
%Y A062037 Cf. A011540, A034710, A062034, A062035, A062036, A062382, A062384, A062040, A062041, A062043, A062045.
%K A062037 nonn,base,easy
%O A062037 1,1
%A A062037 _Amarnath Murthy_, Jun 27 2001
%E A062037 Corrected and extended by Larry Reeves (larryr(AT)acm.org), Jul 06 2001
%E A062037 Offset corrected by _Mohammed Yaseen_, Aug 02 2022