|
|
A331475
|
|
a(n) is the smallest n-digit number using each digit 0 to n-1 once, such that the numbers formed by its last k digits are divisible by k, (k = 1..n).
|
|
1
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
a(n) = A147636(n) for n=1, 2, 3, 9 and 10.
|
|
LINKS
|
|
|
EXAMPLE
|
a(3) = 3012 because 2, 12, 012, 3012 are divisible by 1, 2, 3, 4 and it is the least such number with distinct digits 0 to 3.
|
|
MATHEMATICA
|
ok[n_] := AllTrue[Range@ IntegerLength@ n, Mod[ Mod[n, 10^#], #] == 0 &]; a[n_] := SelectFirst[ FromDigits /@ Permutations[Range[0, n-1]], # >= 10^(n-1) - 1 && ok[#] &]; Array[a, 10] (* Giovanni Resta, May 04 2020 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,fini,full,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|