|
%I #10 Aug 08 2021 01:40:24
%S 2,3,3,3,4,3,3,3,4,3,3,4,5,4,3,3,4,4,5,4,3,3,5,5,5,5,4,3,3,4,5,4,6,6,
%T 4,3,3,5,3,5,5,6,6,4,3,3,4,4,4,4,6,6,6,4,3,3,5,5,6,5,5,6,6,6,4,3,3,4,
%U 4,4,5,4,6,6,5,6,4,3,3,5,5,5,6,5,5,7,6,5,6
%N Triangular array T read by rows: T(n,k)=number of distinct numbers that appear when Euclidean algorithm acts on n,k, for k=1,2,...,n; n=1,2,3,...
%C Counts numbers appearing as either quotients or remainders including the initial n and k. - _Sean A. Irvine_, Aug 07 2021
%K nonn,tabl
%O 1,1
%A _Clark Kimberling_
|
