|
|
A187584
|
|
Least number divisible by at least n of its digits, different and > 1.
|
|
1
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
divQ[m_, n_] := Length[(u = Union[Select[IntegerDigits[m], # > 1 &]])] >= n && Plus @@ (Boole@Divisible[m, u]) >= n; a[n_] := Module[{k = 1}, While[! divQ[k, n], k++]; k]; Array[a, 8] (* Amiram Eldar, Aug 30 2020 *)
|
|
PROG
|
(Python)
def c(n): return len(set(d for d in str(n) if d>'1' and n%int(d)==0))
def a(n):
m = 2*10**(n-1)
while c(m) < n: m += 1
return m
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,fini,full
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|