(Python) # see link for a faster version
from itertools import permutations
def fromdigits(d, b):
n = 0
for di in d: n *= b; n += di
return n
def a(n):
for digits in range(n-1, 0, -1):
for p in permutations(range(n-1, 0, -1), r=digits):
t = fromdigits(p, n)
if all(t%di == 0 for di in p):
return t
