login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A059844
a(n) = smallest nonzero square x^2 such that n+x^2 is prime.
2
1, 1, 4, 1, 36, 1, 4, 9, 4, 1, 36, 1, 4, 9, 4, 1, 36, 1, 4, 9, 16, 1, 36, 49, 4, 81, 4, 1, 144, 1, 16, 9, 4, 9, 36, 1, 4, 9, 4, 1, 576, 1, 4, 9, 16, 1, 36, 25, 4, 9, 16, 1, 36, 25, 4, 81, 4, 1, 324, 1, 36, 9, 4, 9, 36, 1, 4, 81, 4, 1, 36, 1, 16, 9, 4, 25, 36, 1, 4, 9, 16, 1, 144, 25, 4, 81
OFFSET
1,3
COMMENTS
a(n) = 1 for n in A006093. - Robert Israel, Dec 31 2023
LINKS
FORMULA
a(n) + n is the smallest prime of the form x^2 + n.
EXAMPLE
a(24) = 49 because 49 + 24 = 73 is prime and 1 + 24 = 25, 4 + 24 = 28, 9 + 24 = 33, 16 + 24 = 40, 25 + 24 = 49, and 36 + 24 = 60 are composite.
MAPLE
f:= proc(n) local x;
for x from 1 + (n mod 2) by 2 do
if isprime(n+x^2) then return x^2 fi;
od
end proc:
f(1):= 1:
map(f, [$1..100]); # Robert Israel, Dec 31 2023
MATHEMATICA
sqs[n_]:=Module[{q=1}, While[!PrimeQ[n+q], q=(Sqrt[q]+1)^2]; q]; Array[ sqs, 90] (* Harvey P. Dale, Aug 11 2017 *)
KEYWORD
nonn
AUTHOR
Labos Elemer, Feb 26 2001
STATUS
approved