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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A084242 Least k, 1<= k <=n, such that the number of elements of the continued fraction for n/k is maximum. 6
 1, 1, 2, 3, 3, 4, 4, 5, 5, 6, 7, 7, 8, 9, 11, 9, 10, 11, 11, 11, 13, 13, 14, 13, 14, 15, 17, 17, 18, 19, 18, 23, 19, 21, 22, 22, 23, 22, 25, 29, 23, 26, 25, 27, 26, 27, 29, 31, 30, 29, 28, 33, 33, 31, 34, 41, 32, 36, 33, 37, 33, 35, 37, 39, 47, 37, 41, 42, 40, 41, 41, 53, 45, 43 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Also, for n > 1, the smallest number k such that the Euclidean algorithm for (n,k) requires the maximum number of steps, A034883(n). - T. D. Noe, Mar 24 2011 LINKS FORMULA k>1, a(F(k))=F(k-1) where F(k) denotes the k-th Fibonacci number; probably, limit n ->oo 1/n*sum(k=1, n, a(k)) = 1/phi where phi is the Golden ratio (1+sqrt(5))/2 PROG (PARI) a(n)=if(n<0, 0, s=1; while(abs(vecmax(vector(n, i, length(contfrac(n/i))))-length(contfrac(n/s)))>0, s++); s) CROSSREFS Cf. A071677. Sequence in context: A225215 A214672 A268060 * A182281 A218535 A306592 Adjacent sequences:  A084239 A084240 A084241 * A084243 A084244 A084245 KEYWORD nonn AUTHOR Benoit Cloitre, Jun 21 2003 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.

Last modified September 23 20:42 EDT 2021. Contains 347617 sequences. (Running on oeis4.)