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!)
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

%I #4 Jun 20 2013 14:18:20

%S 7,11,12,22,44,53,54,106,108,112,113,144,159,180

%N 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.

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

%C For primitive cycles, GCD(k,6)=1.

%C 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).

%Y Cf. A226626, A226673.

%K nonn

%O 1,1

%A _Geoffrey H. Morley_, Jun 19 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 April 23 11:35 EDT 2024. Contains 371912 sequences. (Running on oeis4.)