The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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
CROSSREFS
Cf. A034883 (maximum length of the Euclidean algorithm)
Sequence in context: A120963 A370587 A200220 * A104142 A258143 A369290
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 18 12:18 EDT 2024. Contains 372630 sequences. (Running on oeis4.)