login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 2
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

Table of n, a(n) for n=0..19.

CROSSREFS

Cf. A034883 (maximum length of the Euclidean algorithm)

Sequence in context: A183036 A120963 A200220 * A104142 A258143 A079713

Adjacent sequences:  A188221 A188222 A188223 * A188225 A188226 A188227

KEYWORD

nonn,more

AUTHOR

T. D. Noe, Mar 24 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 20:19 EST 2021. Contains 349588 sequences. (Running on oeis4.)