Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #7 Mar 30 2012 18:50:18
%S 0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,1,0,0,
%T 0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,1,0,0,0,0,
%U 0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,1,0
%N First of four sequences representing the lexicographical minimal decomposition of n in 4 squares: n = a(n)^2 + A064874(n)^2 + A064875(n)^2 + A064876(n)^2.
%C A072401(n) = A057427(a(n)).
%C For k<112: a(n)=A072401(n), but A072401(112) = 1<>a(112)=2, as also A072401(112 - 1) = 1.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SquareNumber.html">Square Numbers.</a>
%H <a href="/index/Su#ssq">Index entries for sequences related to sums of squares.</a>
%e a(25) = 0: 25 = a(25)^2 + A064874(25)^2 + A064875(25)^2 + A064876(25)^2 = 0 + 0 + 0 + 25 and the other decompositions (0, 0, 3, 4) and (1, 2, 2, 4) are greater than (0, 0, 0, 5).
%Y Cf. A064874, A064875, A064876, A071374.
%K nonn
%O 0,1
%A _Reinhard Zumkeller_, Oct 10 2001