OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
a(3) = 11 because 11 is prime, the third prime is 5, 11^2-2*5^2 = 71 is prime, and 11 is the least prime that works.
MAPLE
f:= proc(n) local q;
q:= floor(sqrt(2)*n);
do
q:= nextprime(q);
if isprime(q^2-2*n^2) then return q fi;
od
end proc:
map(f, [seq(ithprime(i), i=1..100)]);
MATHEMATICA
a[n_] := Module[{m = 2*Prime[n]^2, p}, p = Floor[Sqrt[m]]; While[p = NextPrime[p]; !PrimeQ[p^2 - m]]; p]; Array[a, 100] (* Amiram Eldar, Jul 24 2022 *)
PROG
(Python)
from sympy import isprime, nextprime, prime
def a(n):
p = pn = prime(n)
while not isprime(p*p - 2*pn*pn): p = nextprime(p)
return p
print([a(n) for n in range(1, 64)]) # Michael S. Branicky, Jul 24 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
J. M. Bergot and Robert Israel, Jul 24 2022
STATUS
approved