|
Search: id:A077351
|
|
|
| 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. |
|
+0
3
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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 (mathar(AT)strw.leidenuniv.nl), Mar 20 2007
|
|
CROSSREFS
|
Cf. A077352.
Sequence in context: A048730 A156390 A059680 this_sequence A119530 A012332 A012455
Adjacent sequences: A077348 A077349 A077350 this_sequence A077352 A077353 A077354
|
|
KEYWORD
|
base,hard,more,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 05 2002
|
|
EXTENSIONS
|
Corrected and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 20 2007
a(24) from Don Reble (djr(AT)nk.ca), Nov 07 2007; a(25)-a(29) from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 20 2007
|
|
|
Search completed in 0.002 seconds
|
