This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A188224 #12 Mar 30 2012 17:22:57 %S A188224 1,2,6,10,24,54,96,200,442,650,1548,2370,4060,7670,15792,25740,49074, %T A188224 81900,147756,251012 %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. %C A188224 That is, A034883(k) > n for k > a(n). %Y A188224 Cf. A034883 (maximum length of the Euclidean algorithm) %K A188224 nonn,more %O A188224 0,2 %A A188224 _T. D. Noe_, Mar 24 2011