This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A108714 #3 Mar 31 2012 20:08:02 %S A108714 1,1,1,1,1,1,2,3,1,1,1,7,2,1,1,1,2,5,1,1,4,5,3,1,1,1,2,5,1,11,4,3,2,5, %T A108714 1,1,2,3,1,1,4,5,3,9,1,5,2,13,1,7,1,3,3 %N A108714 a(n)=minimal value of k, such that n^2+k^2 or (n^2+k^2)/2 are primes. %C A108714 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. %e A108714 a(3)=1 because (3^2+1)/2=5 (prime) %e A108714 a(7)=2 ------> 7^2+2^2=53 (prime) %e A108714 a(12)=7 -----> 12^2+7^2=193 (prime) %e A108714 a(23)=3 -----> (23^2+3^2)/2=269 (prime) %e A108714 a(48)=13 ----> 48^2+13^2=2473 (prime) %K A108714 nonn %O A108714 1,7 %A A108714 _Robin Garcia_, Jun 20 2005