cp's OEIS Frontend

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

%I A058904 #17 May 09 2023 19:33:22
%S A058904 42,44,51,52,60,105,109,116,124,173,177,178,181,201,205,209,210,213,
%T A058904 214,217,233,237,241,242,245,249,250,251,254,255,269,273,277,278,282,
%U A058904 285,287,290,298,299,300,308,336,343,348,352,397,401,402,403
%N A058904 Inconsummate numbers in base 8: no number is this multiple of the sum of its digits (in base 8).
%p A058904 For Maple code see A058906.
%t A058904 base=8; 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 21 2017 *)
%o A058904 (Python)
%o A058904 from itertools import count, islice, combinations_with_replacement
%o A058904 def A058904_gen(startvalue=1): # generator of terms
%o A058904     for n in count(max(startvalue,1)):
%o A058904         for l in count(1):
%o A058904             if 7*l*n < 1<<3*(l-1):
%o A058904                 yield n
%o A058904                 break
%o A058904             for d in combinations_with_replacement(range(8),l):
%o A058904                 if (s:=sum(d)) > 0 and sorted(oct(s*n)[2:]) == list(map(str,d)):
%o A058904                     break
%o A058904             else:
%o A058904                 continue
%o A058904             break
%o A058904 A058904_list = list(islice(A058904_gen(),20)) # _Chai Wah Wu_, May 09 2023
%Y A058904 Cf. A003635, A052491, A058898-A058907.
%K A058904 nonn,base
%O A058904 1,1
%A A058904 _N. J. A. Sloane_, Jan 09 2001