OFFSET
1,7
COMMENTS
I am attempting to complete a proof that for every natural number n, there is at least one prime of the form n^2+k^2 or (n^2+k^2)/2 with 1<=k<=n.
EXAMPLE
a(3) = 1 because (3^2+1)/2 = 5 (prime);
a(7) = 2 ------> 7^2+2^2 = 53 (prime);
a(12) = 7 -----> 12^2+7^2 = 193 (prime);
a(23) = 3 -----> (23^2+3^2)/2 = 269 (prime);
a(48) = 13 ----> 48^2+13^2 = 2473 (prime);
...
MATHEMATICA
a[n_]:=Module[{k=1}, While[!PrimeQ[n^2+k^2]&&!PrimeQ[(n^2+k^2)/2], k++]; k]; Array[a, 87] (* Stefano Spezia, Sep 09 2025 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Robin Garcia, Jun 20 2005
EXTENSIONS
a(54)-a(87) from Stefano Spezia, Sep 09 2025
STATUS
approved
