OFFSET
2,1
LINKS
Chai Wah Wu, Table of n, a(n) for n = 2..226
MATHEMATICA
n = 1; Do[ While[k = n; While[ Apply[ Plus, IntegerDigits[k, b] ]*n != k && k < 100n, k += n]; k != 100n, n++ ]; Print[n], {b, 2, 60} ]
PROG
(Python)
from functools import lru_cache
from itertools import count, combinations_with_replacement
from sympy.ntheory import digits
@lru_cache(maxsize=None)
def A061381(n):
for k in count((0 if n <= 2 else A061381(n-1))+1):
for l in count(1):
if (n-1)*l*k < n**(l-1):
return k
for d in combinations_with_replacement(range(n), l):
if (s:=sum(d)) > 0 and sorted(digits(s*k, n)[1:]) == list(d):
break
else:
continue
break # Chai Wah Wu, May 09 2023
CROSSREFS
KEYWORD
base,easy,nice,nonn
AUTHOR
Robert G. Wilson v, Jun 08 2001
STATUS
approved