|
|
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
|
|
|
LINKS
|
|
|
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
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|