|
%I #4 Mar 30 2012 18:56:59
%S 0,0,0,0,1,0,2,1,2,2,4,1,4,4,4,4,7,2,6,5,6,8,8,5,7,7,8,7,10,7,10,9,9,
%T 11,12,6,11,12,10,10,12,11,10,15,12,14,14,10,14,11,16,14,12,12,17,16,
%U 16,16,14,14,10,18,15,16,20,17,16,18,19,19
%N a(n)=number of 2's in n-th row of array T given by A049816.
%e There are 4 numbers k from 1 to 11 for which the Euclidean algorithm on (11,k) has exactly 2 nonzero remainders; hence a(11)=4.
%K nonn
%O 1,7
%A _Clark Kimberling_
|
