%I
%S 1,2,2,2,2,2,2,1,2,4,4,3,3,3,3,1,2,5,5,4,3,3,3,1,2,5,6,6,4,4,5,2,3,6,
%T 6,6,5,6,5,3,3,7,6,4,6,6,6,2,3,7,6,7,6,7,8,3,4,6,6,6,5,6,8,4,4,9,8,8,
%U 7,8,7,2,6,10,9,8,8,9,7,2,6,12,11,8,7,7
%N Number of partitions of n into 3 squares and a nonnegative cube.
%C When n is not of the form 4^a * (8b + 7), according to Legendre's threesquare theorem, n = x^2 + y^2 + z^2 = x^2 + y^2 + z^2 + 0^3 (where a, b, x, y and z are nonnegative integers with x <= y <= z).
%C If n = 8b + 7, then n  1 = 8b + 6 is not of the form 4^a * (8b + 7). So n = (n  1) + 1 = x^2 + y^2 + z^2 + 1^3.
%C If n = 4 * (8b + 7), then n  1 = 8 * (4b + 3) + 3 is also not of the form 4^a * (8b + 7).
%C If n = 4^2 * (8b + 7), then n  8 = 4 * (8 * (4b + 3) + 2) is not of the form 4^a * (8b + 7). n = (n  8) + 8 = x^2 + y^2 + z^2 + 2^3.
%C If n = 4^k * (8b + 7) (k >= 3), then n  8 = 4 * (8 * (4^(k  1) * b + 4^(k  3) * 14)  2) = 4 * (8m  2) is also not of the form 4^a * (8b + 7).
%C That is, every nonnegative integer can be represented as the sum of 3 squares and a nonnegative cube, so a(n) > 0.
%H Robert Israel, <a href="/A297788/b297788.txt">Table of n, a(n) for n = 0..10000</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Legendre%27s_threesquare_theorem">Legendre's threesquare theorem</a>
%e 2 = 0^2 + 0^2 + 1^2 + 1^3 = 0^2 + 1^2 + 0^2 + 1^3, a(2) = 2.
%e 9 = 0^2 + 0^2 + 1^2 + 2^3 = 0^2 + 1^2 + 0^2 + 2^3 = 0^2 + 2^2 + 2^2 + 1^3 = 1^2 + 2^2 + 2^2 + 0^3, a(9) = 4.
%p N:= 100: # to get a(0)..a(N)
%p A:= Array(0..N):
%p for x from 0 to floor(sqrt(N)) do
%p for y from 0 to x while x^2 + y^2 <= N do
%p for z from 0 to y while x^2 + y^2 + z^2 <= N do
%p for w from 0 do
%p t:= x^2 + y^2 + z^2 + w^3;
%p if t > N then break fi;
%p A[t]:= A[t]+1;
%p od od od od:
%p convert(A,list); # _Robert Israel_, Jan 11 2018
%t a[n_]:=Sum[If[x^2+y^2+z^2+w^3==n, 1, 0], {x,0,n^(1/2)}, {y,x,(nx^2)^(1/2)}, {z,y,(nx^2y^2)^(1/2)}, {w,0,(nx^2y^2z^2)^(1/3)}]
%t Table[a[n], {n,0,86}]
%Y Cf. A002635, A004215, A274274.
%K nonn
%O 0,2
%A _XU Pingya_, Jan 06 2018
