cp's OEIS Frontend

A245463 Smallest k such that A002522(k) and A002522(k+2n) are successive primes of the form m^2+1.

%I A245463 #12 Jul 23 2014 10:11:13
%S A245463 2,6,84,66,26,134,40,94,986,184,1524,716,864,1246,2986,784,350,2174,
%T A245463 4796,496,7674,13136,3390,12636,5880,9904,16446,37410,6646,10430,
%U A245463 56774,31870,9054,24606,12986,54284,35000,124320,114216,58576,88854,85416,18854,3536
%N A245463 Smallest k such that A002522(k) and A002522(k+2n) are successive primes of the form m^2+1.
%C A245463 A002522(n) = n^2+1.
%C A245463 Subsequence of A005574.
%H A245463 Jens Kruse Andersen, <a href="/A245463/b245463.txt">Table of n, a(n) for n = 1..163</a>
%e A245463 a(3) = 84 because A002522(84)=7057 and A002522(84+2*3)= 8101 are two consecutive primes of the form m^2+1.
%p A245463 T:=array(1..44):
%p A245463 for n from 1 by 2 to 88 do:
%p A245463    z:=0:ii:=0:
%p A245463     for k from 2 to 10^7 while(z=0) do:
%p A245463     p:=k^2+1:
%p A245463     if type(p,prime)=false
%p A245463      then
%p A245463      ii:=ii+1:
%p A245463      else
%p A245463       if ii=n
%p A245463       then
%p A245463       printf ( "%d %d \n",(n+1)/2,k-n-1):T[(n+1)/2]:=k-n-1:z:=1:
%p A245463       else
%p A245463      fi:
%p A245463      ii:=0:
%p A245463     fi:
%p A245463    od:
%p A245463 od:
%p A245463 print(T):
%o A245463 (PARI) for(n=1, 44, m=2; until(m==k+2*n, k=m; until(isprime(m^2+1), m++)); print1(k", ")) \\ _Jens Kruse Andersen_, Jul 22 2014
%Y A245463 Cf. A002496, A002522, A005574, A134406, A206400.
%K A245463 nonn
%O A245463 1,1
%A A245463 _Michel Lagneau_, Jul 22 2014