%I #19 Apr 15 2019 16:27:01
%S 0,0,0,0,1,0,0,2,0,0,4,0,3,8,0,6,16,0,12,4,9,24,8,18,0,16,36,12,32,0,
%T 24,54,0,48,20,36,81,40,72,30,64,0,60,108,45,96,40,90,48,80,144,60,
%U 135,72,120,54,0,192,108,180,96,160,72,162,256,144,240,100
%N a(n) is the greatest product i*j*k*l where i^2 + j^2 + k^2 + l^2 = n and 0 <= i <= j <= k <= l.
%C The sequence is well defined as every nonnegative integer can be represented as a sum of four squares in at least one way.
%H Robert Israel, <a href="/A307510/b307510.txt">Table of n, a(n) for n = 0..10000</a>
%H Rémy Sigrist, <a href="/A307510/a307510.png">Colored scatterplot of the first 20000 terms</a> (where the color is function of the parity of n)
%H Rémy Sigrist, <a href="/A307510/a307510.txt">C program for A307510</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Lagrange%27s_four-square_theorem">Lagrange's four-square theorem</a>
%F a(n) = 0 iff n belongs to A000534.
%F a(n) <= (n/4)^2, with equality if and only if n is an even square. - _Robert Israel_, Apr 15 2019
%e For n = 34:
%e - 34 can be expressed in 4 ways as a sum of four squares:
%e i^2 + j^2 + k^2 + l^2 i*j*k*l
%e --------------------- -------
%e 0^2 + 0^2 + 3^2 + 5^2 0
%e 0^2 + 3^2 + 3^2 + 4^2 0
%e 1^2 + 1^2 + 4^2 + 4^2 16
%e 1^2 + 2^2 + 2^2 + 5^2 20
%e - a(34) = max(0, 16, 20) = 20.
%p g:= proc(n, k) option remember; local a;
%p if k = 1 then if issqr(n) then return sqrt(n) else return -infinity fi fi;
%p max(0,seq(a*procname(n-a^2, k-1), a=1..floor(sqrt(n))))
%p end proc:
%p seq(g(n, 4), n=0..100); # _Robert Israel_, Apr 15 2019
%t Array[Max[Times @@ # & /@ PowersRepresentations[#, 4, 2]] &, 68, 0] (* _Michael De Vlieger_, Apr 13 2019 *)
%o (C) See Links section.
%Y See A307531 for the additive variant.
%Y Cf. A000534, A002635, A122922.
%K nonn,look
%O 0,8
%A _Rémy Sigrist_, Apr 11 2019