cp's OEIS Frontend

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

%I A058907 #29 May 10 2023 10:55:37
%S A058907 86,87,88,90,99,101,102,112,113,114,125,126,138,229,235,244,245,246,
%T A058907 256,258,269,270,282,307,373,379,385,391,392,400,402,426,451,464,530,
%U A058907 535,536,542,543,547,548,607,608,620,667,673,674,679,680,685
%N A058907 Inconsummate numbers in base 12: no number is this multiple of the sum of its digits (in base 12).
%H A058907 Vincenzo Librandi, <a href="/A058907/b058907.txt">Table of n, a(n) for n = 1..10100</a>
%p A058907 For Maple code see A058906.
%t A058907 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 A058907 (Python)
%o A058907 from itertools import count, islice, combinations_with_replacement
%o A058907 from sympy.ntheory import digits
%o A058907 def A058907_gen(startvalue=1): # generator of terms >= startvalue
%o A058907     for n in count(max(startvalue,1)):
%o A058907         for l in count(1):
%o A058907             if 11*l*n < 12**(l-1):
%o A058907                 yield n
%o A058907                 break
%o A058907             for d in combinations_with_replacement(range(12),l):
%o A058907                 if (s:=sum(d)) > 0 and sorted(digits(s*n,12)[1:]) == list(d):
%o A058907                     break
%o A058907             else:
%o A058907                 continue
%o A058907             break
%o A058907 A058907_list = list(islice(A058907_gen(),20)) # _Chai Wah Wu_, May 10 2023
%Y A058907 Cf. A003635, A052491, A058898, A058899, A058900, A058901, A058902, A058903, A058904, A058905, A058906.
%K A058907 nonn,base
%O A058907 1,1
%A A058907 _N. J. A. Sloane_, Jan 09 2001