cp's OEIS Frontend

A246965 Numbers n such that 19*n-(n+19) is a prime.

%I A246965 #34 Jun 10 2016 15:07:35
%S A246965 2,4,5,6,7,11,12,14,15,16,21,25,26,27,29,30,32,34,37,39,40,41,44,46,
%T A246965 47,49,50,54,55,60,62,65,67,69,71,72,77,81,84,85,89,90,91,92,96,105,
%U A246965 106,107,111,112,116,117,120,124,127,131,132,134,135,137,145,146
%N A246965 Numbers n such that 19*n-(n+19) is a prime.
%H A246965 Jens Kruse Andersen, <a href="/A246965/b246965.txt">Table of n, a(n) for n = 1..10000</a>
%F A246965 a(n) = A138918(n)+1.
%e A246965 17 = (19*2)-(19+2) is prime, so 2 is a term.
%t A246965 Select[Range[150],PrimeQ[18#-19]&] (* _Harvey P. Dale_, Jun 10 2016 *)
%o A246965 (PHP)
%o A246965 for($num=1;$num<x;$num++)
%o A246965 {
%o A246965     $num2=$i;
%o A246965     $finalnumber=($num2*19)-($num2+19);
%o A246965     //gmp_nextprime will find a primenumber greater than the given number
%o A246965     $prime=gmp_nextprime($finalnumber-1);
%o A246965     if($prime==$finalnumber)
%o A246965     {
%o A246965          $sequence=$sequence.",".$prime;
%o A246965     }
%o A246965 }
%o A246965 echo $sequence;
%o A246965 (PARI) lista(nn) = {for (n=1, nn, if (isprime(18*n-19), print1(n, ", ")););} \\ _Michel Marcus_, Sep 09 2014
%o A246965 (Sage) [n for n in (2..200) if is_prime(18*n-19)] # _Bruno Berselli_, Sep 09 2014
%K A246965 nonn
%O A246965 1,1
%A A246965 _Shanmuga Subramanian_, Sep 08 2014