|
| |
|
|
A061604
|
|
Smallest multiple of n containing all 10 digits from 0 to 9.
|
|
1
| |
|
|
1023456789, 1023456798, 1023456789, 1023457896, 1023467895, 1023456798, 1023456798, 1023457896, 1023456789, 1234567890, 1024375869, 1023457896, 1023456798, 1023456798, 1023467895, 1023457968, 1023457698, 1023456798
(list; graph; refs; listen; history; 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.
|
|
|
CROSSREFS
| Sequence in context: A020666 A074205 A204045 * A050278 A171102 A051018
Adjacent sequences: A061601 A061602 A061603 * A061605 A061606 A061607
|
|
|
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.
|
| |
|
|
