login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
For a list of all values of n up to 10000 where a(n)=0, see A179197. - Jon E. Schoenfield, Jul 10 2010
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
Sequence in context: A331911 A307841 A257949 * A370018 A119530 A012332
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy, Nov 05 2002
EXTENSIONS
Corrected and extended by R. J. Mathar, Mar 20 2007
a(24) from Don Reble, Nov 07 2007; a(25)-a(29) from R. J. Mathar, Mar 20 2007
More terms from Jon E. Schoenfield, Jul 02 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 11:14 EDT 2024. Contains 371278 sequences. (Running on oeis4.)