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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226660 Smallest positive integer k with a primitive cycle of n positive integers (n>1) under iteration by the Collatz-like 3x+k function. 3

%I #5 Jul 06 2013 17:18:35

%S 1,5,7,5,11,17,13,97,59,19,55,233,11,73,25,29,47,215,41,103,145,31,13,

%T 119,131,5,47,53,67,17,337,125,115,485,133,127,49,119,191,293,133,23,

%U 79,103,191,167,91,409,329,217,109,449,241,361,353,1303,239,149,73

%N Smallest positive integer k with a primitive cycle of n positive integers (n>1) 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.

%C For n>1, T_k has a primitive cycle of length n which includes 1 when k = A036563(n) = 2^n-3. So a(n) <= 2^n-3.

%H Geoffrey H. Morley, <a href="/A226660/b226660.txt">Table of n, a(n) for n = 2..3908</a>

%Y Cf. A226609, A226661, A226676.

%K nonn

%O 2,2

%A _Geoffrey H. Morley_, Jul 05 2013

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 23:09 EDT 2024. Contains 375519 sequences. (Running on oeis4.)