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!)
 A245217 Decimal expansion of inf{f(n,1)}, where f(1,x) = x + 1 and thereafter f(n,x) = x + 1 if n is in A001951, else f(n,x) = 1/x. 11
 2, 9, 0, 9, 9, 5, 0, 2, 7, 0, 8, 6, 5, 9, 0, 6, 3, 0, 7, 4, 0, 5, 1, 1, 6, 6, 8, 1, 8, 3, 7, 7, 7, 6, 5, 1, 3, 8, 5, 4, 3, 2, 0, 1, 6, 1, 0, 9, 6, 3, 8, 8, 9, 9, 6, 6, 2, 3, 6, 0, 5, 9, 9, 9, 3, 0, 5, 6, 4, 4, 0, 8, 2, 9, 8, 2, 1, 1, 8, 9, 6, 3, 0, 3, 3, 1 (list; constant; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS See Comments at A245215. LINKS Clark Kimberling, Table of n, a(n) for n = 1..1000 FORMULA a(n)*sup{f(n,1)} = 1. EXAMPLE c = 0.29099502708659063074051166818377765138543201...  The first 12 numbers f(n,1) comprise S(12) = {1, 2, 3, 1/3, 4/3, 7/3, 3/7, 10/7, 17/7, 24/7, 7/24, 31/24}; min(S(12)) = 7/24 = 0.29166... MATHEMATICA tmpRec = \$RecursionLimit; \$RecursionLimit = Infinity; u[x_] := u[x] = x + 1; d[x_] := d[x] = 1/x; r = Sqrt[2]; w = Table[Floor[k*r], {k, 2000}]; s[1] = 1; s[n_] := s[n] = If[MemberQ[w, n - 1], u[s[n - 1]], d[s[n - 1]]]; \$RecursionLimit = tmpRec; m = Min[N[Table[s[n], {n, 1, 4000}], 300]] t = RealDigits[m]  (* A245217 *) (* Peter J. C. Moses, Jul 04 2014 *) CROSSREFS Cf. A226080 (infinite Fibonacci tree), A245215, A245218, A245220, A245223. Sequence in context: A192938 A188619 A020817 * A133768 A085333 A248853 Adjacent sequences:  A245214 A245215 A245216 * A245218 A245219 A245220 KEYWORD nonn,cons,easy AUTHOR Clark Kimberling, Jul 13 2014 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 April 17 19:51 EDT 2021. Contains 343070 sequences. (Running on oeis4.)