|
%I #4 Mar 31 2012 12:35:25
%S 1,3,150,15210,1639575,123643611,7614820759,421492526271,
%T 22902703731540,1192049263269315,60248523072916695,
%U 2966823784716819963,139916416171825355244,6279781745619795030660,269526833541639073889370
%N Half the number of length n integer sequences with sum zero and sum of squares 4232.
%H R. H. Hardin, <a href="/A157578/b157578.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,4232)/2.
%K nonn
%O 2,2
%A _R. H. Hardin_ Mar 02 2009
|
