|
|
A058902
|
|
Inconsummate numbers in base 6: no number is this multiple of the sum of its digits (in base 6).
|
|
2
|
|
|
27, 33, 64, 82, 97, 100, 103, 104, 107, 118, 122, 124, 125, 128, 134, 135, 152, 159, 162, 177, 190, 193, 195, 198, 205, 208, 212, 214, 232, 233, 250, 277, 280, 298, 334, 343, 345, 349, 352, 358, 362, 363, 364, 370, 380, 382, 384, 403, 427, 442
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MAPLE
|
|
|
MATHEMATICA
|
base=6; 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, Jan 30 2017 *)
|
|
PROG
|
(Python)
from itertools import count, islice, combinations_with_replacement
from sympy.ntheory import digits
def A058902_gen(startvalue=1): # generator of terms >= startvalue
for n in count(max(startvalue, 1)):
for l in count(1):
if 5*l*n < 6**(l-1):
yield n
break
for d in combinations_with_replacement(range(6), l):
if (s:=sum(d)) > 0 and sorted(digits(s*n, 6)[1:]) == list(d):
break
else:
continue
break
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|