login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Record-breaking values, for increasing k = A226630(n), of the conjectured number of primitive cycles of positive integers under iteration by the Collatz-like 3x-k function.
3

%I #16 Jul 02 2013 13:22:24

%S 3,8,35,136,171,2908,6326

%N Record-breaking values, for increasing k = A226630(n), of the conjectured number of primitive cycles of positive integers under iteration by the Collatz-like 3x-k function.

%C A cycle is called primitive if its elements are not a common multiple of the elements of another cycle.

%C The 3x-k function T_k is defined by T_k(x) = x/2 if x is even, (3x-k)/2 if x is odd, where k is odd.

%C For primitive cycles, GCD(k,6)=1.

%Y k = A226680(n).

%Y Cf. A226629, A226663.

%K nonn,more

%O 1,1

%A _Geoffrey H. Morley_, Jun 15 2013

%E Definition clarified by _Geoffrey H. Morley_, Jun 23 2013