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 A038366 #16 Oct 19 2021 08:45:57 %S A038366 10,19,20,29,30,39,40,42,49,50,59,60,69,70,79,80,89,90,99,100,102,108, %T A038366 110,120,126,132,140,150,180,190,200,201,204,207,209,210,220,230,240, %U A038366 270,280,285,300,306,308,312,320,330,360,370,400,402,405,407,408,410 %N A038366 n is divisible by (product of digits) + (sum of digits). %H A038366 Giovanni Resta, <a href="/A038366/b038366.txt">Table of n, a(n) for n = 1..10000</a> %t A038366 Select[Range[410], Divisible[#, Plus @@ (x = IntegerDigits[#]) + Times @@ x] &] (* _Jayanta Basu_, Jul 14 2013 *) %o A038366 (PARI) isok(m) = my(d=digits(m)); (m % (vecprod(d) + vecsum(d))) == 0; \\ _Michel Marcus_, Oct 29 2019 %o A038366 (Python) %o A038366 from math import prod %o A038366 def ok(n): d = list(map(int, str(n))); return n and n%(sum(d)+prod(d)) == 0 %o A038366 print([k for k in range(411) if ok(k)]) # _Michael S. Branicky_, Oct 19 2021 %Y A038366 Cf. A061762, A061763. %K A038366 easy,nonn,base %O A038366 1,1 %A A038366 _Felice Russo_