|
Search: id:A061604
|
|
|
| A061604 |
|
Smallest multiple of n containing all 10 digits from 0 to 9. |
|
+0
1
|
|
| 1023456789, 1023456798, 1023456789, 1023457896, 1023467895, 1023456798, 1023456798, 1023457896, 1023456789, 1234567890, 1024375869, 1023457896, 1023456798, 1023456798, 1023467895, 1023457968, 1023457698, 1023456798
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
It can be shown that for every positive integer there exist infinitely many multiples containing all the 10 digits.
|
|
CROSSREFS
|
Adjacent sequences: A061601 A061602 A061603 this_sequence A061605 A061606 A061607
Sequence in context: A095733 A020666 A074205 this_sequence A050278 A051018 A020667
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 19 2001
|
|
EXTENSIONS
|
Corrected and extended by Patrick De Geest (pdg(AT)worldofnumbers.com), Jun 04 2001.
|
|
|
Search completed in 0.002 seconds
|
