OFFSET
1,1
COMMENTS
Conjecture: an integer will always be reached, i.e. a(n) > 0 for all n.
PROG
(Python)
from fractions import Fraction
def A365367(n):
x, c = Fraction(n), 0
while x.denominator > 1 or x<=n:
x = Fraction(5*x.__round__(), 3)
c += 1
return c
CROSSREFS
KEYWORD
nonn
AUTHOR
Chai Wah Wu, Sep 02 2023
STATUS
approved