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 A062045 #20 Sep 13 2022 02:20:15
%S A062045 666,1479,1497,1568,1586,1658,1685,1749,1794,1856,1865,1947,1974,2349,
%T A062045 2394,2439,2446,2464,2493,2644,2934,2943,3249,3294,3345,3354,3429,
%U A062045 3435,3453,3492,3534,3543,3924,3942,4179,4197,4239,4246,4264,4293,4329,4335,4353,4392
%N A062045 Positive numbers whose product of digits is 12 times their sum.
%H A062045 Harry J. Smith, <a href="/A062045/b062045.txt">Table of n, a(n) for n = 1..500</a>
%e A062045 2349 belongs to the sequence as (2*3*4*9)/(2+3+4+9) = 216/18 = 12.
%t A062045 okQ[n_]:=Module[{idn=IntegerDigits[n]},Times@@idn/Total[idn]==12]
%t A062045 Select[Range[10000],okQ] (* _Harvey P. Dale_, Nov 25 2010 *)
%o A062045 (PARI) isok(n) = my(d=digits(n)); vecprod(d)==12*vecsum(d) \\ _Mohammed Yaseen_, Sep 12 2022
%o A062045 (Python)
%o A062045 from math import prod
%o A062045 def ok(n): d = list(map(int, str(n))); return prod(d) == 12*sum(d)
%o A062045 print([k for k in range(1, 4400) if ok(k)]) # _Michael S. Branicky_, Sep 12 2022
%Y A062045 Subsequence of A061013 and hence A038367 and A052382.
%Y A062045 Cf. A011540, A034710, A062034, A062035, A062036, A062382, A062037, A062384, A062040, A062041, A062043.
%K A062045 nonn,base,easy
%O A062045 1,1
%A A062045 _Amarnath Murthy_, Jun 28 2001
%E A062045 Corrected and extended by Larry Reeves (larryr(AT)acm.org), Jul 06 2001
%E A062045 More terms from _Harvey P. Dale_, Nov 25 2010
%E A062045 Offset corrected by _Mohammed Yaseen_, Sep 12 2022