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 A160006 #2 Mar 30 2012 17:26:29 %S A160006 1,1,2,1,2,1,3,2,3,1,2,4,3,1,2,4,3,1,4,2,3,5,1,2,6,3,5,4,1,2,5,3,4,7, %T A160006 6,1,2,5,3,7,4,6,1,2,8,3,6,4,1,5,2,7,3,6,4,9,8,5,1,2,3,6,9,4,7,5,1,2, %U A160006 9,3,8,4,7,5,9,1,2,6,8,3,4,11,10,7,5,1,2,6,3,10,4,7,9,5,12,8,1,6,2,10,3,4,9 %N A160006 a(n) = least number b such that A000404(n) = b^2+c^2, 0 < b <= c. %e A160006 a(1)=1 because A000404(1)=2=1^2+1^2, %e A160006 a(2)=1 because A000404(2)=5=1^2+2^2, %e A160006 a(3)=2 because A000404(3)=8=2^2+2^2, %e A160006 a(9932)=141 (maximal value for n<=10000) because A000404(9932)=39762=141^2+141^2. %Y A160006 A000404 Numbers that are the sum of 2 nonzero squares. %K A160006 nonn %O A160006 1,3 %A A160006 _Zak Seidov_, Apr 29 2009