%N Triangular array T given by rows: T(n,k)=sum of quotients when Euclidean algorithm acts on n and k; for k=1,2,...,n; n=1,2,3,...
%C First quotient=[ n/k ]=Q1; 2nd=[ k/(n-k*Q1) ]; ...
%C Number of squares in a greedy tiling of an n-by-k rectangle by squares. [David Radcliffe, Nov 14 2012]
%A _Clark Kimberling_