Array read by antidiagonals: T(n,k) = number of steps in simple Euclidean algorithm for gcd(n,k) where n >= 1, k >= 1.
A072030
Array read by antidiagonals: T(n,k) = number of steps in simple Euclidean algorithm for gcd(n,k) where n >= 1, k >= 1.
Terms
- a(0) =1a(1) =2a(2) =2a(3) =3a(4) =1a(5) =3a(6) =4a(7) =3a(8) =3a(9) =4a(10) =5a(11) =2a(12) =1a(13) =2a(14) =5a(15) =6a(16) =4a(17) =4a(18) =4a(19) =4a(20) =6a(21) =7a(22) =3a(23) =4a(24) =1a(25) =4a(26) =3a(27) =7a(28) =8a(29) =5
External references
- oeis: A072030