%I #4 Mar 31 2012 12:35:25
%S 1,3,150,5070,182175,5887791,180232444,5773910724,178835952285,
%T 4946264437455,125256800641170,2987737855296558,68285219070825029,
%U 1509200139206357640,32387266774022554680,675011623200542959496
%N Half the number of length n integer sequences with sum zero and sum of squares 1058.
%H R. H. Hardin, <a href="/A157555/b157555.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,1058)/2.
%K nonn
%O 2,2
%A _R. H. Hardin_ Mar 02 2009
|