Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #24 Sep 08 2022 08:45:17
%S 3,4,6,7,8,10,12,14,15,18,19,20,21,24,25,26,29,32,34,35,49,50,54,57,
%T 59,60,62,72,77,79,87,89,94,101,104,111,115,132,134,137,138,140,141,
%U 142,148,154,161,162,164,167,168,180,181,182,183,186,190,192,195,203,204
%N Numbers n such that n*prime(n)+(n+1)*prime(n+1) is prime.
%C Or, numbers n such that A152117(n) is prime. - _Zak Seidov_, Feb 05 2016
%e 4*prime(4)+5*prime(5) = 4*7+5*11 = 83 prime.
%t bb={};Do[If[PrimeQ[n Prime[n]+(n+1)Prime[n+1]], bb=Append[bb, n]], {n, 400}];bb
%t Select[Range[250],PrimeQ[# Prime[#]+(#+1)Prime[#+1]]&] (* _Harvey P. Dale_, Dec 08 2011 *)
%o (PARI) isok(n) = isprime(n*prime(n)+(n+1)*prime(n+1)); \\ _Michel Marcus_, Feb 05 2016
%o (PARI) lista(nn) = {for(n=1, nn, if(ispseudoprime(n*prime(n)+(n+1)*prime(n+1)), print1(n, ", ")));} \\ _Altug Alkan_, Feb 05 2016
%o (Magma) [n: n in [1..250] | IsPrime(n*NthPrime(n)+(n+1)*NthPrime(n+1))]; // _Vincenzo Librandi_, Feb 06 2016
%Y Cf. A152117, A119487.
%K nonn
%O 1,1
%A _Zak Seidov_, May 02 2005