For k > a(n), the maximum number of steps that the Euclidean algorithm requires for computing (k,i), with i < k, is greater than n.

A188224

For k > a(n), the maximum number of steps that the Euclidean algorithm requires for computing (k,i), with i < k, is greater than n.

Terms

    a(0) =1a(1) =2a(2) =6a(3) =10a(4) =24a(5) =54a(6) =96a(7) =200a(8) =442a(9) =650a(10) =1548a(11) =2370a(12) =4060a(13) =7670a(14) =15792a(15) =25740a(16) =49074a(17) =81900a(18) =147756a(19) =251012

External references