%I #8 Jun 15 2013 01:37:08
%S 1,3,4,11,12,22,8,6,4,14,8,11,11,44,5,12,14,24,7,8,5,43,28,19,6,12,43,
%T 10,14,28,15,20,53,6,11,11,20,8,43,12,6,14,10,14,54,8,10,14,14,7,10,
%U 12,28,9,43,14,7,25,11,10,35,7,36,32,24,28,17,24
%N Fewest odd numbers in a primitive cycle of positive integers under iteration by the 3xk function, where k=A226630(n).
%C A cycle is called primitive if its elements are not a common multiple of the elements of another cycle.
%C The 3xk function T_k is defined by T_k(x) = x/2 if x is even, (3xk)/2 if x is odd.
%H Geoffrey H. Morley, <a href="/A226632/b226632.txt">Table of n, a(n) for n = 1..600</a>
%F a(n) = min_{j=A226628(n) to A226628(n+1)1} A226626(j).
%K nonn
%O 1,2
%A _Geoffrey H. Morley_, Jun 14 2013
