|
|
A077351
|
|
Smallest multiple of n using all the digits of all its divisors (a permutation of the concatenation of its divisors), or 0 if no such number exists.
|
|
4
|
|
|
1, 12, 0, 124, 15, 1236, 0, 1248, 0, 11250, 0, 0, 0, 21714, 11355, 112864, 0, 0, 0, 10122540, 0, 0, 0, 1122234648, 1525, 112632, 0, 11242784, 0, 10112335560, 0, 11223648, 0, 131274, 13755, 0, 0, 123918, 0, 10012245480, 0, 11122234746, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MAPLE
|
A077351 := proc(n) local ndvs, ds, d, m, muldivs ; ndvs := [] ; ds := numtheory[divisors](n) ; for d from 1 to nops(ds) do ndvs := [op(ndvs), op(convert(op(d, ds), base, 10))]; od ; ndvs := sort(ndvs) ; m := floor( 10^(nops(ndvs)-1)/n) ; while m*n < op(-1, ndvs)*10^(nops(ndvs)-1) do muldivs := sort(convert(m*n, base, 10)) ; if muldivs = ndvs then RETURN(m*n) ; fi ; m := m+1 ; od ; RETURN(0) ; end: for n from 1 to 25 do print(n, A077351(n)) ; od ; # R. J. Mathar, Mar 20 2007
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|