%I #4 Mar 31 2012 12:35:25
%S 1,3,462,41230,2595765,186323823,13994329244,1089068168952,
%T 80599569668955,5296880405561547,320164718544367950,
%U 18262041337319290446,998477188502752352485,52770671879708445120045,2707901917377956941817496
%N Half the number of length n integer sequences with sum zero and sum of squares 6050.
%H R. H. Hardin, <a href="/A157587/b157587.txt">Table of n, a(n) for n=2..50</a>
%F [cache enabling] count(n,s,ss)->count(n,t,tt) where t=s mod n, q=(t-s)/n, tt=ss+2*q*s+n*q^2; count(n,t,tt)=sum[i^2<=tt]{ count(n-1,t-i,tt-i^2) }. a(n)=count(n,0,6050)/2.
%K nonn
%O 2,2
%A _R. H. Hardin_ Mar 02 2009