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!)
A286607 Numbers that are not divisible by the sum of their factorial base digits (A034968). 3
3, 5, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 25, 28, 29, 31, 32, 33, 34, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 53, 55, 57, 58, 59, 61, 62, 63, 64, 65, 66, 67, 68, 69, 71, 73, 74, 76, 77, 78, 79, 81, 82, 83, 84, 85, 86, 87, 88, 89, 92, 93, 94, 95, 97, 98, 99, 100, 101, 102, 103, 104, 106, 107 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MATHEMATICA
q[n_] := Module[{k = n, m = 2, r, s = 0}, While[{k, r} = QuotientRemainder[k, m]; k != 0|| r != 0, s += r; m++]; !Divisible[n, s]]; Select[Range[120], q] (* Amiram Eldar, Feb 21 2024 *)
PROG
(Scheme, with Antti Karttunen's IntSeq-library)
(define A286607 (NONZERO-POS 1 1 A286604))
(Python)
def a007623(n, p=2): return n if n<p else a007623(n//p, p+1)*10 + n%p
def ok(n):
x=a007623(n)
y=sum(int(k) for k in str(x))
return n%y!=0
print([n for n in range(1, 111) if ok(n)]) # Indranil Ghosh, Jun 21 2017
CROSSREFS
Cf. A034968, A118363 (complement), A286604.
Sequence in context: A140607 A352487 A340787 * A204827 A366882 A168252
KEYWORD
nonn,base
AUTHOR
Antti Karttunen, Jun 18 2017
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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)