|
%I #15 Feb 13 2024 13:38:07
%S 1,3,5,6,7,10,11,13,15,17,20,22,27,32,33,35,36,41,45,46,48,50,52,53,
%T 55,56,61,62,63,66,67,70,75,80,81,82,83,87,91,92,95,96,98,102,106,108,
%U 112,113,115,117,118,122,126,130,131,132,133,137,138,140,143,148,150,151
%N Numbers k such that 66*k + 1 is prime.
%H Harvey P. Dale, <a href="/A157201/b157201.txt">Table of n, a(n) for n = 1..1000</a>
%e If k = 33, then 66*k + 1 = 66(33) + 1 = 2179 (prime).
%p a := proc (n) if isprime(66*n+1) = true then n else end if end proc: seq(a(n), n = 1 .. 170); # _Emeric Deutsch_, Mar 06 2009
%t Select[Range[200],PrimeQ[66#+1]&] (* _Harvey P. Dale_, Feb 13 2024 *)
%o (PARI) is(n)=isprime(66*n+1) \\ _Charles R Greathouse IV_, Dec 27 2013
%K nonn,easy
%O 1,2
%A _Kyle D. Balliet_, Feb 25 2009
%E More terms from _Emeric Deutsch_, Mar 06 2009
|
