|
%I #7 Apr 13 2013 13:46:37
%S 902,145,771,1060,3569,520,938,294,2457,3911,1650,483,8604,3450,2345,
%T 548,25004,1635,5767,14519,2518,6394,198,7961,4272,8370,4146,654,4489,
%U 6987,222,5426,5250,17670,7691,360,3994,20821,9008,6525,9204,1464,6111,6625,11229,3315,62340,735,6962,5236
%N Smallest j such that j*2*p(n)^3-1=q is prime, j*2*p(n)*q^2-1=r, j*2*p(n)*r^2-1=s, where r and s are also prime.
%H Pierre CAMI, <a href="/A224611/b224611.txt">Table of n, a(n) for n = 1..3500</a>
%t a[n_] := For[j = 1, j < 10^7, j++, p = Prime[n]; If[PrimeQ[q = j*2*p^3 - 1] && PrimeQ[r = j*2*p*q^2 - 1] && PrimeQ[j*2*p*r^2 - 1], Return[j]]]; Table[ Print[an = a[n]]; an, {n, 1, 50}] (* _Jean-François Alcover_, Apr 12 2013 *)
%Y Cf. A224491, A224609, A224610, A224612.
%K nonn
%O 1,1
%A _Pierre CAMI_, Apr 12 2013
|
