cp's OEIS Frontend

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

%I A058899 #18 May 10 2023 12:18:28
%S A058899 17,32,44,51,94,95,96,106,107,112,118,132,148,153,199,224,226,232,235,
%T A058899 236,238,256,265,268,269,274,277,281,282,284,285,288,296,308,318,321,
%U A058899 334,336,343,352,354,368,396,442,443,444,454,459,469,472
%N A058899 Inconsummate numbers in base 3: no number is this multiple of the sum of its digits (in base 3).
%H A058899 Daniel Mondot, <a href="/A058899/b058899.txt">Table of n, a(n) for n = 1..13275</a>
%p A058899 For Maple code see A058906.
%t A058899 base=3; Do[k=n; While[Apply[Plus, IntegerDigits[k, base]] n!=k&&k<250 n, k+=n]; If[k==250 n, Print[n]], {n, 1, 10^3}] (* _Vincenzo Librandi_, Sep 23 2017 *)
%o A058899 (Python)
%o A058899 from itertools import count, islice, combinations_with_replacement
%o A058899 from sympy.ntheory import digits
%o A058899 def A058899_gen(startvalue=1): # generator of terms >= startvalue
%o A058899     for n in count(max(startvalue,1)):
%o A058899         for l in count(1):
%o A058899             if 2*l*n < 3**(l-1):
%o A058899                 yield n
%o A058899                 break
%o A058899             for d in combinations_with_replacement((0,1,2),l):
%o A058899                 if (s:=sum(d)) > 0 and sorted(digits(s*n,3)[1:]) == list(d):
%o A058899                     break
%o A058899             else:
%o A058899                 continue
%o A058899             break
%o A058899 A058899_list = list(islice(A058899_gen(),20)) # _Chai Wah Wu_, May 10 2023
%Y A058899 Cf. A003635, A052491, A058898-A058907.
%K A058899 nonn,base
%O A058899 1,1
%A A058899 _N. J. A. Sloane_, Jan 09 2001