cp's OEIS Frontend

A082466 Least k>=1 such that n^2+kn-1 and n^2+kn+1 are twin primes.

%I A082466 #10 Nov 25 2013 14:09:11
%S A082466 3,1,1,11,1,1,53,1,3,5,7,3,11,16,1,11,43,6,11,1,1,8,13,1,17,7,3,11,43,
%T A082466 4,11,4,7,8,31,9,17,1,9,35,1,4,53,4,7,41,43,6,23,1,17,8,67,1,5,4,17,
%U A082466 11,1,7,197,4,3,11,25,1,227,7,3,14,157,19,11,16,3,71,43,6,53,7,7,44,31,3,41
%N A082466 Least k>=1 such that n^2+kn-1 and n^2+kn+1 are twin primes.
%H A082466 R. J. Mathar, <a href="/A082466/b082466.txt">Table of n, a(n) for n = 1..1000</a>
%p A082466 A082466 := proc(n)
%p A082466     local k,p ;
%p A082466     for k from 1 do
%p A082466         p := (n+k)*n-1 ;
%p A082466         if isprime(p) and isprime(p+2) then
%p A082466             return k;
%p A082466         end if;
%p A082466     end do:
%p A082466 end proc: # _R. J. Mathar_, Jul 20 2012
%t A082466 lk[n_]:=Module[{k=1},While[!And@@PrimeQ[n^2+k*n+{1,-1}],k++];k]; Array[ lk,90] (* _Harvey P. Dale_, Nov 25 2013 *)
%o A082466 (PARI) a(n)=if(n<0,0,k=1; while(isprime(n^2+k*n+1)*isprime(n^2+k*n-1)==0,s++); k)
%K A082466 nonn
%O A082466 1,1
%A A082466 _Benoit Cloitre_, Apr 27 2003