The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A226677 Smallest positive integer k (or 0 if no such k) with a primitive cycle of positive integers, exactly n of which are odd, under iteration by the Collatz-like 3x-k function. 3
 1, 1, 11, 17, 115, 31, 1, 29, 1417, 371, 19, 23, 8977, 77, 431, 2465, 2069, 3299, 193, 451, 139, 25, 5233, 131, 1739, 10993, 3037, 121, 7061, 11329, 9479, 145, 2425, 46199, 1871, 217, 3551, 26183, 14083, 26281, 7237, 605, 181, 113, 3299, 11431, 119773, 2465 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 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. Conjecture: a(n)>0 for all n. LINKS Geoffrey H. Morley, Table of n, a(n) for n = 1..60 CROSSREFS Cf. A226626, A226661, A226676. Sequence in context: A136721 A107172 A090286 * A056577 A166655 A262552 Adjacent sequences: A226674 A226675 A226676 * A226678 A226679 A226680 KEYWORD nonn AUTHOR Geoffrey H. Morley, Jul 05 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 25 01:41 EDT 2024. Contains 374585 sequences. (Running on oeis4.)