

A226670


Recordbreaking values, for increasing positive integers k == 1 or 5 mod 6, of the conjectured length of the longest primitive cycle(s) of positive integers under iteration by the Collatzlike 3x+k function.


4



2, 27, 31, 43, 65, 66, 100, 106, 118, 136, 140, 141, 162, 200, 222, 262, 426, 476, 526, 636, 737, 1922, 2254, 4531, 4686, 5194, 5945, 9946, 10702, 14219, 16340, 19904, 37582, 40983, 49711, 63330
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

A cycle is called primitive if its elements are not a common multiple of the elements of another cycle.
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.
For primitive cycles, GCD(k,6)=1.


LINKS



CROSSREFS

k = A226671(n). The smallest integer in the T_k cycle(s) associated with a(n) is A226672(n).


KEYWORD

nonn


AUTHOR



EXTENSIONS



STATUS

approved



