|
|
A180489
|
|
Smallest pandigital number (A171102) divisible by the n-th prime A000040(n).
|
|
5
|
|
|
1023456798, 1023456789, 1023467895, 1023456798, 1024375869, 1023456798, 1023457698, 1023458769, 1023475689, 1023468957, 1023458769, 1023654987, 1023458769, 1023469875, 1023467958, 1023459786, 1023457896, 1023458976
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Digits may appear more than once in the multiple, resulting in 11-or-more-digit values of a(n). The first entry for which that happens is a(10545), because the smallest multiple of the 10545th prime 111119 that contains all the digits 0-9 is 92373 * 111119 = 10264395387, and all smaller primes have 10-digit pandigital multiples. - David J. Seal, Sep 18 2017
|
|
LINKS
|
|
|
EXAMPLE
|
a(1) is the smallest pandigital number divisible by prime(1) = 2, which is 1023456798. - David J. Seal, Sep 18 2017
|
|
MATHEMATICA
|
With[{s = Select[FromDigits@ # & /@ Permutations[Range[0, 9], {10}], # > 10^9 &]}, Table[SelectFirst[s, Divisible[#, Prime@ n] &], {n, 18}]] (* Michael De Vlieger, Sep 18 2017, after Robert G. Wilson v at A171102 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|