function lazysamsum(n)

if 1
  H = eye(n);
  H(1,:) = ones(1,n);
  
  G = H'*H
  sqrt(max(eig(G)))

  sum(G)
  % other good ex.

end
  
if 0
  for i=1:n
    for j=1:n
      G(i,j) = (i<=j)*i + (i>j)*j;
    end
  end

  
%  lam = sqrt(sum(G(:)))/n^(3/2)
  % yes, that's the correct growth


%return
x=(1:n)';
%bot = sqrt(sum(x.^2));
%x = x/bot;

top = x'*G*x;

val = top / n^4

%lam = sqrt(top)/n^(3/2)

end

return