|
%I #31 May 10 2023 10:43:36
%S 13,17,29,16,27,30,42,46,62,68,86,92,114,122,147,154,182,192,222,232,
%T 266,278,314,326,367,380,422,436,482,498,546,562,614,632,688,704,762,
%U 782,842,862,926,948,1014,1036,1107,1130,1202,1226,1302,1328,1406,1432
%N Smallest "inconsummate number" in base n: smallest number such that in base n, no number is this multiple of the sum of its digits.
%H Chai Wah Wu, <a href="/A052491/b052491.txt">Table of n, a(n) for n = 2..174</a>
%e a(10) = 62, from A003635.
%t Do[n = 1; While[k = n; While[ Apply[ Plus, IntegerDigits[k, b] ]*n != k && k < 100n, k += n ]; k != 100n, n++ ]; Print[n], {b, 2, 54} ]
%o (Python)
%o from itertools import count, combinations_with_replacement
%o from sympy.ntheory import digits
%o def A052491(n):
%o for k in count(1):
%o for l in count(1):
%o if (n-1)*l*k < n**(l-1):
%o return k
%o for d in combinations_with_replacement(range(n),l):
%o if (s:=sum(d)) > 0 and sorted(digits(s*k,n)[1:]) == list(d):
%o break
%o else:
%o continue
%o break # _Chai Wah Wu_, May 09 2023
%Y Cf. A003635, A058898-A058907.
%K nonn,nice,easy,base
%O 2,1
%A _J. H. Conway_, Dec 30 2000
%E Corrected and extended by _David Radcliffe_, Jan 08 2001
%E More terms from _David W. Wilson_, Jan 10 2001
|
