A058907 - OEIS

%I #29 May 10 2023 10:55:37

%S 86,87,88,90,99,101,102,112,113,114,125,126,138,229,235,244,245,246,

%T 256,258,269,270,282,307,373,379,385,391,392,400,402,426,451,464,530,

%U 535,536,542,543,547,548,607,608,620,667,673,674,679,680,685

%N Inconsummate numbers in base 12: no number is this multiple of the sum of its digits (in base 12).

%H Vincenzo Librandi, <a href="/A058907/b058907.txt">Table of n, a(n) for n = 1..10100</a>

%p For Maple code see A058906.

%t base=12; Do[k=n; While[Apply[Plus, IntegerDigits[k, base]] n!=k&&k<250n, k+=n]; If[k==250 n, Print[n]], {n, 1, 10^3}] (* _Vincenzo Librandi_, Sep 23 2017; after _N. J. A. Sloane_ in A058906 *)

%o (Python)

%o from itertools import count, islice, combinations_with_replacement

%o from sympy.ntheory import digits

%o def A058907_gen(startvalue=1): # generator of terms >= startvalue

%o     for n in count(max(startvalue,1)):

%o         for l in count(1):

%o             if 11*l*n < 12**(l-1):

%o                 yield n

%o                 break

%o             for d in combinations_with_replacement(range(12),l):

%o                 if (s:=sum(d)) > 0 and sorted(digits(s*n,12)[1:]) == list(d):

%o                     break

%o             else:

%o                 continue

%o             break

%o A058907_list = list(islice(A058907_gen(),20)) # _Chai Wah Wu_, May 10 2023

%Y Cf. A003635, A052491, A058898, A058899, A058900, A058901, A058902, A058903, A058904, A058905, A058906.

%K nonn,base

%O 1,1

%A _N. J. A. Sloane_, Jan 09 2001