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 A134754 #4 Mar 31 2012 13:21:04 %S A134754 23,39,39,55,55,55,59,59,63,71,71,71,71,75,75,75,75,79,79,87,87,87,87, %T A134754 87,91,91,91,91,91,91,95,95,95,95,95,96,96,99,99,103,103,103,103,103, %U A134754 103,103,107,107,107,107,107,107,107,107,111,111,111,111,111,111,111 %N A134754 Minimal number such that all greater numbers can be written as sums of squares >1 in more than n ways. %C A134754 The sequence is well-defined, in that a(n) exists for all n>=0. For the reasoning see A078134. %F A134754 a(n)=min( m | A078134(j)>n for all j>m). %e A134754 a(0)=23, since numbers >23 can be written as sum of squares >1. %e A134754 a(2)=39, since there are at least three ways, to write a number >39 as a sum of squares >1. %Y A134754 Cf. A078134, A078135, A078136, A090677, A078137, A134755. %K A134754 nonn %O A134754 0,1 %A A134754 _Hieronymus Fischer_, Nov 11 2007