A391190 a(n) is the least multiple of n that contains all digits 0-9 at least once.

1234567890, 1234567890, 1234567890, 1234567908, 1234567890, 1234567890, 1234567908, 1234570896, 1234567890, 1234567890, 1234568709, 1234567908, 1234568790, 1234567908, 1234567890, 1234570896, 1234569087, 1234567890, 1234576908, 1234567980, 1234567908, 1234570986, 1234568079, 1234570896

Offset

1,1

Comments

a(n) is the least member of A171102 that is a multiple of n.

Links

Robert Israel, Table of n, a(n) for n = 1..10000

Example

a(4) = 1234567908 because 1234567908 contains each digit once, 1234567908 = 308641977 * 4, and no smaller number works.

Maple

f:= proc(n) local k, a0;
     a0:= 123456789*10^max(1, padic:-ordp(n, 10));
   for k from ceil(a0/n) do if nops(convert(convert(n*k, base, 10), set))=10 then return n*k fi od
end proc:
map(f, [$1..100]);

Crossrefs

Cf. A171102.

Sequence in context: A022250 A344365 A211770 * A167461 A135605 A091416

Adjacent sequences: A391187 A391188 A391189 * A391191 A391192 A391193

Keyword

nonn,base

Author

Robert Israel, Dec 02 2025

Status

approved