This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A247462 Number of iterations needed in A058977 to reach a result. 3
 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS a(A247468(n)) = n and a(m) < n for m < A247468(n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 EXAMPLE Consider f-trajectories and their lengths, where f(p/q)=A008472(p+q)/A001221(p+q), the iterating function in definition of A058977: a(454) = 3: 454/1 - 25/3 - 9/2 - 11/1 a(1401) = 4: 1401/1 - 703/2 - 55/3 - 31/2 - 7/1; a(7364) = 5: 7364/1 - 499/3 - 253/2 - 25/3 - 9/2 - 11/1. PROG (Haskell) import Data.Ratio ((%), numerator, denominator, Ratio) a247462 1 = 1 a247462 n = fst \$ until ((== 1) . denominator . snd)                         (\(i, x) -> (i + 1, f x)) (0, 1 % n) where    f x = a008472 x' % a001221 x' where x' = numerator x + denominator x CROSSREFS Cf. A058977, A008472, A001221, A247468. Sequence in context: A105931 A279495 A300409 * A323172 A327403 A247371 Adjacent sequences:  A247459 A247460 A247461 * A247463 A247464 A247465 KEYWORD nonn AUTHOR Reinhard Zumkeller, Sep 17 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 October 16 13:51 EDT 2019. Contains 328093 sequences. (Running on oeis4.)