OFFSET
1,2
COMMENTS
The property "numbers divisible by the sum and product of their digits" leads to the Diophantine equation t*x1*x2*...*xr=s*(x1+x2+...+xr), where t and s are divisors of n; xi is from [1...9]. This corresponds to some arithmetic problems in geometry, see Sándor, 2002. - Ctibor O. Zizka, Mar 04 2008
LINKS
David A. Corneth, Table of n, a(n) for n = 1..10352 (first 1000 terms from T. D. Noe)
József Sándor, Geometric Theorems, Diophantine Equations and Arithmetic Functions, American Research Press, Rehoboth, 2002.
FORMULA
MATHEMATICA
dspQ[n_]:=Module[{idn=IntegerDigits[n], t}, t=Times@@idn; t!=0 && Divisible[n, Total[idn]] && Divisible[n, t]]; Select[Range[11500], dspQ] (* Harvey P. Dale, Jul 11 2011 *)
PROG
(Haskell)
import Data.List (elemIndices)
a038186 n = a038186_list !! (n-1)
a038186_list = map succ $ elemIndices 1
$ zipWith (*) (map a188641 [1..]) (map a188642 [1..])
-- Reinhard Zumkeller, Apr 07 2011
(PARI) for(n=1, 10^4, d=digits(n); s=sumdigits(n); p=prod(i=1, #d, d[i]); if(p&&!(n%s+n%p), print1(n, ", "))) \\ Derek Orr, Apr 29 2015
(Python)
from math import prod
def sd(n): return sum(map(int, str(n)))
def pd(n): return prod(map(int, str(n)))
def ok(n): return n%sd(n) == 0 and pd(n) and n%pd(n) == 0
def aupto(limit): return [m for m in range(1, limit+1) if ok(m)]
print(aupto(11233)) # Michael S. Branicky, Jan 28 2021
CROSSREFS
KEYWORD
AUTHOR
EXTENSIONS
More terms from Patrick De Geest, Jun 15 1999
STATUS
approved