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 A025415 #21 Feb 04 2013 04:19:34 %S A025415 14,62,101,161,206,314,341,446,689,734,854,1106,1154,1286,1454,1781, %T A025415 1889,2054,2141,2609,2966,3134,3461,3449,3506,4241,4289,4781,5066, %U A025415 4826,5381,5561,7686,7094,6254,7829,8186,8069,8609,8126,8774,9686,10526,11066 %N A025415 Least sum of 3 distinct nonzero squares in exactly n ways. %C A025415 The sequence is increasing only up to a(23) = 3461 > a(24) = 3449. - _M. F. Hasler_, Jan 25 2013 %H A025415 Zak Seidov and Donovan Johnson, <a href="/A025415/b025415.txt">Table of n, a(n) for n = 1..1000</a> (first 200 terms from Zak Seidov) %H A025415 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a> %H A025415 Zak Seidov, <a href="/wiki/User_talk:Zak_Seidov#First_300_terms_of_A025415">First 300 terms of A025415</a> %e A025415 a(1) = 1^2+2^2+3^2 = 1+4+9 = 14, which obviously is the smallest sum of 3 distinct nonzero squares and cannot be written otherwise as such a sum. %e A025415 a(2) = 1^2+5^2+6^2 = 1+25+36 = 2^2+3^2+7^2 = 4+9+49 = 62. %K A025415 nonn %O A025415 1,1 %A A025415 _David W. Wilson_