%I #3 Mar 02 2015 16:08:46
%S 0,1,0,3,4,0,3,1,1,0,4,3,2,1,0,2,3,1,4,2,0,2,6,7,3,9,10,0,7,3,5,1,3,1,
%T 1,0,1,1,3,2,3,4,5,6,0,3,4,9,3,1,2,3,1,4,0,9,1,9,4,9,12,13,5,15,16,0,
%U 9,2,3,3,7,1,2,4,1,2,2,0,7,9,2,3,3,9,2,1,1,3,3,4,0,2,2,13,6,5,7,1,3,2,9
%N T(n,m) for positive n,m is the first integer we get when iterating f starting with f(n/m), where function f on rationals is defined as f(p/q)=abs(pq)/NextOddCollatz(p)(we assume p,q coprime), where NextOddCollatz(p) is the next odd number that is found in the Collatz trajectory of p. When no integer is reached by iteration, T(n,m)=0.
%e The triangle begins:
%e ........0
%e ......1...0
%e ....3...4...0
%e ..3...1...1...0
%e 4...3...2...1...0
%Y T(n, 1) forms A062366.
%K nonn,tabl
%O 1,4
%A _Floor van Lamoen_, Jul 16 2001
