cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A058905 #13 May 10 2023 12:18:15
%S A058905 46,47,48,56,58,66,76,86,136,138,167,176,222,227,228,248,258,298,302,
%T A058905 308,312,316,318,338,343,344,347,348,352,354,356,358,362,374,383,384,
%U A058905 392,398,402,403,404,406,407,408,411,412,414,416,422,423
%N A058905 Inconsummate numbers in base 9: no number is this multiple of the sum of its digits (in base 9).
%p A058905 For Maple code see A058906.
%o A058905 (Python)
%o A058905 from itertools import count, islice, combinations_with_replacement
%o A058905 from sympy.ntheory import digits
%o A058905 def A058905_gen(startvalue=1): # generator of terms >= startvalue
%o A058905     for n in count(max(startvalue,1)):
%o A058905         for l in count(1):
%o A058905             if l*n<<3 < 9**(l-1):
%o A058905                 yield n
%o A058905                 break
%o A058905             for d in combinations_with_replacement(range(9),l):
%o A058905                 if (s:=sum(d)) > 0 and sorted(digits(s*n,9)[1:]) == list(d):
%o A058905                     break
%o A058905             else:
%o A058905                 continue
%o A058905             break
%o A058905 A058905_list = list(islice(A058905_gen(),20)) # _Chai Wah Wu_, May 10 2023
%Y A058905 Cf. A003635, A052491, A058898-A058907.
%K A058905 nonn,base
%O A058905 1,1
%A A058905 _N. J. A. Sloane_, Jan 09 2001