OFFSET
1,1
LINKS
Giovanni Resta, Table of n, a(n) for n = 1..10000
MATHEMATICA
Select[Range[410], Divisible[#, Plus @@ (x = IntegerDigits[#]) + Times @@ x] &] (* Jayanta Basu, Jul 14 2013 *)
PROG
(PARI) isok(m) = my(d=digits(m)); (m % (vecprod(d) + vecsum(d))) == 0; \\ Michel Marcus, Oct 29 2019
(Python)
from math import prod
def ok(n): d = list(map(int, str(n))); return n and n%(sum(d)+prod(d)) == 0
print([k for k in range(411) if ok(k)]) # Michael S. Branicky, Oct 19 2021
CROSSREFS
KEYWORD
easy,nonn,base
AUTHOR
STATUS
approved