function y=summation(n)summation=0;for j= 0:n for k =0:n for i=max([0,j+k-n]):min([j,k]) summation=summation+(-1)^(k-i)*nchoosek(2*k,2*i)*nchoosek(n-k,j-i); end endendy=summation
