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!)
 A225920 a(n) is the least k such that f(a(n-1)+1) + ... + f(k) > f(a(n-2)+1) + ... + f(a(n-1)) for n > 1, where f(n) = 1/(n+5) and a(1) = 1. 1
 1, 13, 48, 150, 447, 1312, 3831, 11167, 32531, 94748, 275938, 803605, 2340292, 6815476, 19848236, 57802615, 168334451, 490228448, 1427657419 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Conjecture:  a(n) is linearly recurrent.  See A225918 for details. LINKS EXAMPLE a(1) = 1 by decree; a(2) = 13 because 1/7 + ... + 1/17 < 1 < 1/7 + ... + 1/(13+5), so that a(3) = 48 because 1/19 + ... + 1/52 < 1/7 + ... + 1/18 < 1/19 + ... + 1/(48+5). Successive values of a(n) yield a chain: 1 < 1/(1+6) + ... + 1/(13+5) < 1/(13+6) + ... + 1/(48+5) < 1/(48+6) + ... + 1/(150+5) < ... Abbreviating this chain as b(1) = 1 < b(2) < b(3) < b(4) < ... < R = 2.912229..., it appears that lim_{n->infinity} b(n) = log(R) = 1.068918... . MATHEMATICA nn = 11; f[n_] := 1/(n + 5); a[1] = 1; g[n_] := g[n] = Sum[f[k], {k, 1, n}]; s = 0; a[2] = NestWhile[# + 1 &, 2, ! (s += f[#]) >= a[1] &]; s = 0; a[3] = NestWhile[# + 1 &, a[2] + 1, ! (s += f[#]) >= g[a[2]] - f[1] &]; Do[s = 0; a[z] = NestWhile[# + 1 &, a[z - 1] + 1, ! (s += f[#]) >= g[a[z - 1]] - g[a[z - 2]] &], {z, 4, nn}]; m = Map[a, Range[nn]] CROSSREFS Cf. A225918. Sequence in context: A146806 A300337 A135712 * A027980 A200254 A288746 Adjacent sequences:  A225917 A225918 A225919 * A225921 A225922 A225923 KEYWORD nonn,more AUTHOR Clark Kimberling, May 21 2013 EXTENSIONS a(12)-a(16) from Robert G. Wilson v, May 22 2013 a(17)-a(18) from Robert G. Wilson v, Jun 13 2013 a(18) corrected by and a(19) from Jinyuan Wang, Jun 14 2020 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 June 18 11:39 EDT 2021. Contains 345098 sequences. (Running on oeis4.)