1,7
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.
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)
Sequence in context: A140737 A108756 A106178 this_sequence A135508 A030413 A139434
Adjacent sequences: A108711 A108712 A108713 this_sequence A108715 A108716 A108717
nonn
Robin Garcia (verob99(AT)teleline.es), Jun 20 2005
Search completed in 0.002 seconds