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!)
A058907 Inconsummate numbers in base 12: no number is this multiple of the sum of its digits (in base 12). 11
86, 87, 88, 90, 99, 101, 102, 112, 113, 114, 125, 126, 138, 229, 235, 244, 245, 246, 256, 258, 269, 270, 282, 307, 373, 379, 385, 391, 392, 400, 402, 426, 451, 464, 530, 535, 536, 542, 543, 547, 548, 607, 608, 620, 667, 673, 674, 679, 680, 685 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MAPLE
For Maple code see A058906.
MATHEMATICA
base=12; 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 23 2017; after N. J. A. Sloane in A058906 *)
PROG
(Python)
from itertools import count, islice, combinations_with_replacement
from sympy.ntheory import digits
def A058907_gen(startvalue=1): # generator of terms >= startvalue
for n in count(max(startvalue, 1)):
for l in count(1):
if 11*l*n < 12**(l-1):
yield n
break
for d in combinations_with_replacement(range(12), l):
if (s:=sum(d)) > 0 and sorted(digits(s*n, 12)[1:]) == list(d):
break
else:
continue
break
A058907_list = list(islice(A058907_gen(), 20)) # Chai Wah Wu, May 10 2023
CROSSREFS
Sequence in context: A143759 A020665 A259084 * A045101 A020215 A094776
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Jan 09 2001
STATUS
approved

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 April 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)