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!)
 A245225 Continued fraction expansion of the constant c in A245224; c = sup{f(n,1)}, where f(1,x) = x + 1 and thereafter f(n,x) = x + 1 if n is in A054385, else f(n,x) = 1/x. 3
 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS See Comments at A245215. LINKS EXAMPLE c = 2.70777871600507812434020666596313162... ; The first 16 numbers f(n,1) comprise S(16) = {1, 2, 1/2, 3/2, 5/2, 2/5, 7/5, 12/5, 5/12, 17/12, 12/17, 29/17}; max(S(16)) = 46/17, with continued fraction [2, 1, 2, 2, 2]. MATHEMATICA tmpRec = \$RecursionLimit; \$RecursionLimit = Infinity; u[x_] := u[x] = x + 1; d[x_] := d[x] = 1/x; r = E/(E-1); 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]]]; max = Max[N[Table[s[n], {n, 1, 3000}], 200]] (* A245224 *) ContinuedFraction[max, 120] (* A245225 *) CROSSREFS Cf. A226080 (infinite Fibonacci tree), A245217, A245219, A245222, A245224. Sequence in context: A233138 A214708 A083952 * A214860 A263649 A229904 Adjacent sequences:  A245222 A245223 A245224 * A245226 A245227 A245228 KEYWORD nonn,cofr,easy AUTHOR Clark Kimberling, Jul 14 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 June 4 04:39 EDT 2020. Contains 334815 sequences. (Running on oeis4.)