cp's OEIS Frontend

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

%I A286607 #17 Feb 21 2024 01:21:06
%S A286607 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 A286607 42,43,44,45,46,47,49,50,51,53,55,57,58,59,61,62,63,64,65,66,67,68,69,
%U A286607 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 A286607 Numbers that are not divisible by the sum of their factorial base digits (A034968).
%H A286607 Antti Karttunen, <a href="/A286607/b286607.txt">Table of n, a(n) for n = 1..10000</a>
%H A286607 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>.
%t A286607 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 A286607 (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o A286607 (define A286607 (NONZERO-POS 1 1 A286604))
%o A286607 (Python)
%o A286607 def a007623(n, p=2): return n if n<p else a007623(n//p, p+1)*10 + n%p
%o A286607 def ok(n):
%o A286607     x=a007623(n)
%o A286607     y=sum(int(k) for k in str(x))
%o A286607     return n%y!=0
%o A286607 print([n for n in range(1, 111) if ok(n)]) # _Indranil Ghosh_, Jun 21 2017
%Y A286607 Cf. A034968, A118363 (complement), A286604.
%K A286607 nonn,base
%O A286607 1,1
%A A286607 _Antti Karttunen_, Jun 18 2017