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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A226617 Smallest positive integer k (or 0 if no such k) with a primitive cycle of positive integers, n of which are odd including 1, under iteration by the Collatz-like 3x+k function. 1
 1, 11, 43, 55, 643, 97, 673, 41, 1843, 329, 59, 113, 5603, 289, 6505, 77, 407, 127, 499, 79, 865, 749 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 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 EXAMPLE The cycle associated with a(1)=1 is {1,2}, with a(2)=11 is {1,7,16,8,4,2}, and with a(3)=43 is {1,23,56,28,14,7,32,16,8,4,2}. CROSSREFS Cf. A226607, A226610, A226616. Sequence in context: A096638 A089712 A155711 * A222184 A141195 A139853 Adjacent sequences:  A226614 A226615 A226616 * A226618 A226619 A226620 KEYWORD nonn AUTHOR Geoffrey H. Morley, Jul 03 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 August 14 13:28 EDT 2020. Contains 336480 sequences. (Running on oeis4.)