cp's OEIS Frontend

A349738 Numbers k such that A255217(k) divides A002110(k).

%I A349738 #12 Dec 05 2021 00:06:08
%S A349738 2,4,5,9,15,17,20,24,25,26,27,29,31,32,33,34,37,44,45,46,49,51,52,61,
%T A349738 62,63,64,71,74,79,80,81,82,85,87,88,91,95,103,104,105,110,111,112,
%U A349738 115,117,118,119,120,121,127,131,135,137,142,148,150,152,154,158,159,163,165,173,175,177,179,181
%N A349738 Numbers k such that A255217(k) divides A002110(k).
%H A349738 Martin Ehrenstein, <a href="/A349738/b349738.txt">Table of n, a(n) for n = 1..10000</a>
%e A349738 a(3) = 5 is a term because A255217(5) = 2*3*5*7*11 mod (2+3+5+7+11) = 14 divides 2*3*5*7*11.
%p A349738 P:= 1: S:= 0: p:= 1:
%p A349738 count:= 0: R:= NULL:
%p A349738 for n from 1 while count < 100 do
%p A349738   p:= nextprime(p);
%p A349738   P:= P*p; S:= S+p;
%p A349738   r:= P mod S;
%p A349738   if r = 0 then next fi;
%p A349738   v:= P mod r;
%p A349738   if v = 0 then
%p A349738     count:= count+1; R:= R,n;
%p A349738   fi
%p A349738 od:
%p A349738 R;
%t A349738 Select[Range[200], (m = Mod[Times @@ (p = Prime[Range[#]]), Plus @@ p]) > 0 && Divisible[Times @@ p, m] &] (* _Amiram Eldar_, Nov 28 2021 *)
%Y A349738 Cf. A002110, A007504, A255217. Contains A349734.
%K A349738 nonn
%O A349738 1,1
%A A349738 _J. M. Bergot_ and _Robert Israel_, Nov 28 2021