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!)
 A261133 a(n) = Max{k from {1..n} | T(n,k) = A049831(n)}, where T(n,k) is the triangle defined at A049828. 0
 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 7, 7, 8, 9, 9, 10, 11, 11, 12, 13, 13, 14, 14, 15, 16, 16, 17, 17, 18, 19, 19, 20, 20, 21, 22, 22, 23, 23, 24, 25, 25, 26, 26, 27, 28, 28, 29, 29, 30, 31, 31, 32, 33, 33, 34, 34, 35, 36, 36, 37, 38, 38, 39 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS For the n-th row of the triangle T(n,k) defined in A049828, a(n) is the largest index where the maximum of that row, namely A049831(n), is obtained. Conjecture: a(n)/n -> (sqrt(5)-1)/2, see Szocs-Mihai link. LINKS Tiberiu Szocs-Mihai, Convergence of euclidean summation function, Math Ticks Blog, January 2011. PROG (PARI) t(n, k) = {x = n; y = k; r = 1; s = 0; while (r, q = x\y; r = x - y*q; s +=r; x = y; y = r; ); s; } row(n) = vector(n, k, t(n, k)); a(n) = v = row(n); vm = vecmax(v); forstep(k=n, 1, -1, if (v[k] == vm, return(k))); \\ Michel Marcus, Aug 31 2015 CROSSREFS Cf. A049828, A049831. Sequence in context: A194245 A317648 A284007 * A179211 A180639 A025766 Adjacent sequences:  A261130 A261131 A261132 * A261134 A261135 A261136 KEYWORD nonn,easy AUTHOR Tiberiu Szocs-Mihai, Aug 10 2015 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 18 17:02 EDT 2020. Contains 337170 sequences. (Running on oeis4.)