The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A226689 Conjectured record-breaking numbers of odd elements, for ascending positive integers k, in primitive cycles of positive integers under iteration by the Collatz-like 3x-k function. 2
 7, 11, 12, 22, 44, 53, 54, 106, 108, 112, 113, 144, 159, 180 (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. For primitive cycles, GCD(k,6)=1. For n<15, but probably not for all n, k = A226687(n) and the smallest integer in the T_k cycle associated with a(n) is A226688(n). LINKS CROSSREFS Cf. A226626, A226673. Sequence in context: A228523 A193301 A213250 * A117610 A176173 A200327 Adjacent sequences:  A226686 A226687 A226688 * A226690 A226691 A226692 KEYWORD nonn AUTHOR Geoffrey H. Morley, Jun 19 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 18 16:27 EST 2020. Contains 331011 sequences. (Running on oeis4.)