cp's OEIS Frontend

A349734 Numbers k such that A255217(k) divides A007504(k).

%I A349734 #13 Nov 29 2021 01:20:21
%S A349734 2,5,15,17,20,25,26,33,37,45,49,51,71,87,88,91,105,111,121,127,173,
%T A349734 175,199,203,213,221,262,271,287,305,307,319,324,329,368,377,410,411,
%U A349734 415,439,445,455,463,467,468,473,547,558,561,567,585,589,591,614,651,661,663,665,670,673,743,761,765
%N A349734 Numbers k such that A255217(k) divides A007504(k).
%H A349734 Robert Israel, <a href="/A349734/b349734.txt">Table of n, a(n) for n = 1..10000</a>
%e A349734 a(2) = 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 = 28.
%p A349734 P:= 1: S:= 0: p:= 1:
%p A349734 count:= 0: R:= NULL:
%p A349734 for n from 1 while count < 100 do
%p A349734   p:= nextprime(p);
%p A349734   P:= P*p; S:= S+p;
%p A349734   r:= P mod S;
%p A349734   if r = 0 then next fi;
%p A349734   v:= S mod r;
%p A349734   if v = 0 then
%p A349734     count:= count+1; R:= R,n;
%p A349734   fi
%p A349734 od:
%p A349734 R;
%t A349734 Select[Range[1000], (m = Mod[Times @@ (p = Prime[Range[#]]), Plus @@ p]) > 0 && Divisible[Plus @@ p, m] &] (* _Amiram Eldar_, Nov 28 2021 *)
%Y A349734 Cf. A002110, A007504, A255217, A349738.
%K A349734 nonn
%O A349734 1,1
%A A349734 _J. M. Bergot_ and _Robert Israel_, Nov 28 2021