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 A099332 #16 Feb 19 2013 17:54:11
%S A099332 2,5,13,17,29,37,61,73,89,97,101,109,149,157,181,193,229,241,257,269,
%T A099332 277,293,349,409,421,433,461,521,541,593,601,641,661,701,709,733,769,
%U A099332 797,829,853,881,929,937,953,997,1009,1021,1049,1061,1069,1109,1117
%N A099332 Primes p such that p = a^2 + b^2 for a,b>0 and a+b is prime.
%C A099332 Let q=a+b. For a specific prime q, the number of distinct primes p that are the sum of two squares is A082519(q)/2.
%C A099332 Primes p of the form (q-b)^2 + b^2, where q is prime and 0<b<q.
%H A099332 T. D. Noe, <a href="/A099332/b099332.txt">Table of n, a(n) for n=1..1000</a>
%F A099332 Primes p such that p = (q^2 + x^2)/2, where q is prime and |x| < q. - Thomas Ordowski, Feb 15 2013
%e A099332 29 is in this sequence because 29=2^2+5^2 and 2+5 is prime.
%t A099332 Needs["NumberTheory`NumberTheoryFunctions`"]; lst={2}; Do[n=4k+1; If[PrimeQ[n], If[PrimeQ[Plus@@QuadraticRepresentation[1, n]], AppendTo[lst, n]]], {k, 500}]; lst
%Y A099332 Cf. A082519 (number of times that k^2 + (n-k)^2 is prime for 1 <= k <= n-1).
%K A099332 nonn
%O A099332 1,1
%A A099332 _T. D. Noe_, Oct 15 2004