login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061604 Smallest multiple of n containing all 10 digits from 0 to 9. 3
1023456789, 1023456798, 1023456789, 1023457896, 1023467895, 1023456798, 1023456798, 1023457896, 1023456789, 1234567890, 1024375869, 1023457896, 1023456798, 1023456798, 1023467895, 1023457968, 1023457698, 1023456798 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

It can be shown that for every positive integer there exist infinitely many multiples containing all the 10 digits.

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..1000

MATHEMATICA

With[{t=Sort[FromDigits[Join[{1}, #]]&/@Permutations[{2, 3, 4, 5, 6, 7, 8, 9, 0}]]}, Flatten[ Table[Select[t, Divisible[#, n]&, 1], {n, 20}]]] (* Harvey P. Dale, Aug 26 2014 *)

CROSSREFS

Cf. A171102.

Sequence in context: A277054 A218770 A204045 * A171102 A050278 A051018

Adjacent sequences:  A061601 A061602 A061603 * A061605 A061606 A061607

KEYWORD

nonn,base,easy

AUTHOR

Amarnath Murthy, May 19 2001

EXTENSIONS

Corrected and extended by Patrick De Geest, Jun 04 2001.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified July 27 04:52 EDT 2017. Contains 289841 sequences.