A188224 - OEIS

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

COMMENTS

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

LINKS

CROSSREFS

Cf. A034883 (maximum length of the Euclidean algorithm)

KEYWORD

nonn,more

AUTHOR

T. D. Noe, Mar 24 2011

STATUS

approved