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 A088934 #2 Mar 31 2012 10:29:03 %S A088934 19,13,19,13,2,3,13,19,13,3,13,7,5,3,13,7,5,13,13,7,5,5,19,13,7,5,13, %T A088934 13,7,5,5,19,13,7,5,13,7,7,5,13,7,17,11,11,7,7,17,11,13,7,17,11,13,7, %U A088934 7,17,11,13,7,11,11,7,7,11,13,7,17,11,11,7,7,17,11,13,7,17,11,11,7,7,17,11 %N A088934 Maximum prime required for the representation of n by a signed sum of squares of distinct primes that has the minimal number of terms A088910(n). %e A088934 See example in A088910. %Y A088934 Cf. A089294 representation minimizing the maximum occurring prime instead of minimizing the number of terms, A089297 representation of the squares of primes by squares of distinct other primes. %K A088934 nonn %O A088934 0,1 %A A088934 _Hugo Pfoertner_, Nov 06 2003