login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058901 Inconsummate numbers in base 5: no number is this multiple of the sum of its digits (in base 5). 3

%I #23 May 10 2023 10:44:29

%S 16,22,28,46,56,58,68,74,76,80,106,108,110,118,128,136,138,140,146,

%T 152,168,198,202,206,208,230,249,256,258,262,263,268,274,276,278,280,

%U 284,286,288,290,292,294,296,298,302,318,323,324,326,336,338

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

%H Daniel Mondot, <a href="/A058901/b058901.txt">Table of n, a(n) for n = 1..33069</a>

%p For Maple code see A058906.

%t base=5; Do[k=n; While[Apply[Plus, IntegerDigits[k, base]] n!=k&&k<250n, k+=n]; If[k==250 n, Print[n]], {n, 1, 10^4}] (* _Vincenzo Librandi_, Nov 03 2016 *)

%o (Python)

%o from itertools import count, islice, combinations_with_replacement

%o from sympy.ntheory import digits

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

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

%o for l in count(1):

%o if 4*l*n < 5**(l-1):

%o yield n

%o break

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

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

%o break

%o else:

%o continue

%o break

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

%Y Cf. A003635, A052491, A058898-A058907.

%K nonn,base

%O 1,1

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)