This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A227686 Numerator of least splitting rational of s(n) and s(n+1), where s(n) = 1 + 1/2^2 + ... + 1/n^2. 2
 1, 4, 7, 10, 22, 3, 29, 20, 17, 14, 25, 36, 11, 30, 19, 46, 27, 35, 51, 91, 8, 141, 85, 61, 45, 82, 37, 95, 29, 50, 71, 113, 21, 97, 76, 55, 123, 34, 81, 47, 107, 60, 73, 86, 112, 138, 190, 307, 13, 395, 239, 174, 135, 109, 96, 83, 153, 70, 127, 57, 158, 101 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Suppose that x < y.  The least splitter of x and y is introduced at A227631 as the least positive integer d such that x <= c/d < y for some integer c; the number c/d is called the least splitting rational of x and y. LINKS Clark Kimberling, Table of n, a(n) for n = 1..1000 EXAMPLE The denominators (A227685) and numerators (A227686) can be read from this chain:  s(1) <= 1 < s(2) < 4/3 < s(3) < 7/5 < s(4) < 10/7 < s(5) < 22/15 < ... MATHEMATICA Module[{c, d}, d = NestWhile[#1 + 1 &, 1, ! (c = Ceiling[#1 x - 1]) < Ceiling[#1 y] - 1 &]; (c + 1)/d]; s[n_] := s[n] = Sum[k^(-2), {k, 1, n}] t = Table[r[s[n], s[n + 1]], {n, 1, 150}] (*fractions) fd = Denominator[t] (*A227685*) fn = Numerator[t]   (*A227686*) CROSSREFS Cf. A227631, A227685. Sequence in context: A161334 A111981 A080922 * A161863 A102649 A084386 Adjacent sequences:  A227683 A227684 A227685 * A227687 A227688 A227689 KEYWORD nonn,frac,easy AUTHOR Clark Kimberling, Jul 19 2013 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 15 17:43 EDT 2019. Contains 324142 sequences. (Running on oeis4.)