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.

1, 2, 6, 10, 24, 54, 96, 200, 442, 650, 1548, 2370, 4060, 7670, 15792, 25740, 49074, 81900, 147756, 251012

Offset: 0

Author

T. D. Noe, Mar 24 2011

Keywords

• nonn
• more

Comments

That is, A034883(k) > n for k > a(n).

Crossrefs

Cf. A034883 (maximum length of the Euclidean algorithm)