%I A051010
%S A051010 0,0,1,0,1,2,0,1,1,2,0,1,2,3,2,0,1,1,1,2,2,0,1,2,2,3,3,2,0,1,1,3,1,4,2,
%T A051010 2,0,1,2,1,2,3,2,3,2,0,1,1,2,2,1,3,3,2,2,0,1,2,3,3,2,3,4,4,3,2,0,1,1,1,
%U A051010 1,3,1,4,2,2,2,2,0,1,2,2,2,4,2,3,5,3,3,3,2,0,1,1,3,2,3,2,1,3,4,3
%N A051010 Triangle T(m,n) giving of number of steps in the Euclidean algorithm 
               for GCD(m,n) with 0<=m<n.
%H A051010 T. D. Noe, <a href="b051010.txt">Rows n=1..100 of triangle, flattened</
               a>
%H A051010 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               EuclideanAlgorithm.html">Link to a section of The World of Mathematics.</
               a>
%Y A051010 Cf. A034883, A051011, A051012.
%Y A051010 Cf. A049826
%Y A051010 Sequence in context: A128186 A048823 A025871 this_sequence A130027 A116949 
               A114708
%Y A051010 Adjacent sequences: A051007 A051008 A051009 this_sequence A051011 A051012 
               A051013
%K A051010 nonn,nice,tabl
%O A051010 1,6
%A A051010 Eric Weisstein (eric(AT)weisstein.com)