Triangle T(m,n) giving of number of steps in the Euclidean algorithm for gcd(m,n) with 0<=m<n.
A051010
Triangle T(m,n) giving of number of steps in the Euclidean algorithm for gcd(m,n) with 0<=m<n.
Terms
- a(0) =0a(1) =0a(2) =1a(3) =0a(4) =1a(5) =2a(6) =0a(7) =1a(8) =1a(9) =2a(10) =0a(11) =1a(12) =2a(13) =3a(14) =2a(15) =0a(16) =1a(17) =1a(18) =1a(19) =2a(20) =2a(21) =0a(22) =1a(23) =2a(24) =2a(25) =3a(26) =3a(27) =2a(28) =0a(29) =1
External references
- oeis: A051010