OFFSET
0,2
COMMENTS
In this sequence, the initial value is counted and a(n) = A210468(n) + 1.
This variation of the "3x+1" problem with a class of rational numbers is as follows: start with any number 1/(2n+1). If the numerator is even, divide it by 2, otherwise multiply it by 3 and add 1. Do we always reach the end of a cycle with a rational number? It is conjectured that the answer is yes.
LINKS
J. C. Lagarias, The set of rational cycles for the 3x+1 problem, Acta Arith. 56 (1990), 33-53.
FORMULA
a(n) = A210468(n) + 1.
MATHEMATICA
Collatz[n_]:=NestWhileList[If[EvenQ[Numerator[#]], #/2, 3 #+1]&, n, UnsameQ, All]; Join[{1}, Table[s=Collatz[1/(2*n+1)]; len=Length[s]-1; If[s[[-1]]==2, len=len-1]; len, {n, 100}]]
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Lagneau, Jan 22 2013
STATUS
approved