A058899 Inconsummate numbers in base 3: no number is this multiple of the sum of its digits (in base 3).
17, 32, 44, 51, 94, 95, 96, 106, 107, 112, 118, 132, 148, 153, 199, 224, 226, 232, 235, 236, 238, 256, 265, 268, 269, 274, 277, 281, 282, 284, 285, 288, 296, 308, 318, 321, 334, 336, 343, 352, 354, 368, 396, 442, 443, 444, 454, 459, 469, 472
Offset: 1
Links
- Daniel Mondot, Table of n, a(n) for n = 1..13275
Programs
-
Maple
For Maple code see A058906.
-
Mathematica
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 *)
-
Python
from itertools import count, islice, combinations_with_replacement from sympy.ntheory import digits def A058899_gen(startvalue=1): # generator of terms >= startvalue for n in count(max(startvalue,1)): for l in count(1): if 2*l*n < 3**(l-1): yield n break for d in combinations_with_replacement((0,1,2),l): if (s:=sum(d)) > 0 and sorted(digits(s*n,3)[1:]) == list(d): break else: continue break A058899_list = list(islice(A058899_gen(),20)) # Chai Wah Wu, May 10 2023