A226678 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.

11, 17, 1, 385, 131, 193, 641, 23, 217, 7775, 57095, 3689, 1163, 14185, 8533, 467, 46199, 20143, 87089, 15217, 973, 134809, 14279

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 and k is in A226630.

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

Links

Table of n, a(n) for n=1..23.

Crossrefs

Cf. A226629, A226662.

Sequence in context: A032075 A024147 A025141 * A105709 A256546 A031329

Adjacent sequences: A226675 A226676 A226677 * A226679 A226680 A226681

Keyword

nonn

Author

Geoffrey H. Morley, Jun 25 2013

Status

approved