_R. H. Hardin (rhhardin(AT)att.net) _ Mar 02 2009
_R. H. Hardin (rhhardin(AT)att.net) _ Mar 02 2009
R. H. Hardin, <a href="/A157547/b157547.txt">Table of n, a(n) for n=2..50</a>
nonn,new
nonn
Ron R. H. Hardin, <a href="b157547.txt">Table of n, a(n) for n=2..50</a>
nonn,new
nonn
Ron R. H. Hardin (rhhardin(AT)att.net) Mar 02 2009
Half the number of length n integer sequences with sum zero and sum of squares 450.
1, 3, 126, 2170, 37335, 921333, 21967484, 466292604, 9161931075, 164162481681, 2705726857350, 41747317681290, 619096670144225, 8923605271290360, 124998845674120920, 1699006653803990456, 22382667992161145863
2,2
Ron Hardin, <a href="b157547.txt">Table of n, a(n) for n=2..50</a>
[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,450)/2.
nonn
Ron Hardin (rhhardin(AT)att.net) Mar 02 2009
approved