OFFSET
2,1
COMMENTS
Solutions to the Diophantine partition of (4n+1)^2 into 4 distinct nonzero squares are counted in A175958.
The table contains four numbers a,b,c,d in row n illustrating one particular solution, minimizing a, if there are two solutions with the same a minimizing b etc.
EXAMPLE
The table starts in row n=2 as
2, 4, 5, 6; # 2^2 + 4^2 + 5^2 + 6^2 = (4*2+1)^2
1, 2, 8, 10; # 1^2 + 2^2 + 8^2 + 10^2 = (4*3+1)^2
2, 4, 10, 13; # 2^2 + 4^2 + 10^2 + 13^2 = (4*4+1)^2
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Pedro Fernandez (fourier07(AT)gmail.com), Oct 26 2010
EXTENSIONS
Replaced the 4 terms with a generic definition; connected to A175958 - R. J. Mathar, Nov 17 2010
STATUS
approved