A286607 - OEIS

%I #19 Sep 10 2025 23:55:16

%S 3,5,7,10,11,13,14,15,17,19,21,22,23,25,28,29,31,32,33,34,37,38,39,41,

%T 42,43,44,45,46,47,49,50,51,53,55,57,58,59,61,62,63,64,65,66,67,68,69,

%U 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

%N Numbers that are not divisible by the sum of their factorial base digits (A034968).

%H Antti Karttunen, <a href="/A286607/b286607.txt">Table of n, a(n) for n = 1..10000</a>

%H <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>.

%t 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 *)

%o (Scheme) ;; With _Antti Karttunen_'s IntSeq-library.

%o (define A286607 (NONZERO-POS 1 1 A286604))

%o (Python)

%o def a007623(n, p=2): return n if n<p else a007623(n//p, p+1)*10 + n%p

%o def ok(n):

%o     x=a007623(n)

%o     y=sum(int(k) for k in str(x))

%o     return n%y!=0

%o print([n for n in range(1, 111) if ok(n)]) # _Indranil Ghosh_, Jun 21 2017

%Y Cf. A034968, A118363 (complement), A286604.

%K nonn,base

%O 1,1

%A _Antti Karttunen_, Jun 18 2017