login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

%I #12 Mar 30 2012 17:22:57

%S 1,2,6,10,24,54,96,200,442,650,1548,2370,4060,7670,15792,25740,49074,

%T 81900,147756,251012

%N 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 That is, A034883(k) > n for k > a(n).

%Y Cf. A034883 (maximum length of the Euclidean algorithm)

%K nonn,more

%O 0,2

%A _T. D. Noe_, Mar 24 2011