|
%I #4 Mar 31 2012 12:35:25
%S 1,9,90,17270,2392575,203322273,14072688875,881578169937,
%T 54028224275760,3177868465756435,181594395820598805,
%U 10109617693345774539,538976083520642296074,27345902242485061861185,1326768997661185039512750
%N Half the number of length n integer sequences with sum zero and sum of squares 5408.
%H R. H. Hardin, <a href="/A157584/b157584.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,5408)/2.
%K nonn
%O 2,2
%A _R. H. Hardin_ Mar 02 2009
|
