login
Smallest positive integer (or 0 if no such k) with conjecturally exactly n primitive cycles of positive integers under iteration by the Collatz-like 3x-k function.
1

%I #5 Jun 27 2013 12:06:45

%S 11,17,1,385,131,193,641,23,217,7775,57095,3689,1163,14185,8533,467,

%T 46199,20143,87089,15217,973,134809,14279

%N Smallest positive integer (or 0 if no such k) with conjecturally exactly n 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 and k is in A226630.

%C Conjecture: a(n)>0 for all n.

%Y Cf. A226629, A226662.

%K nonn

%O 1,1

%A _Geoffrey H. Morley_, Jun 25 2013