login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226663 Conjectured record-breaking numbers, for ascending positive integers k, of primitive cycles of positive integers under iteration by the Collatz-like 3x+k function. 3
1, 5, 9, 19, 20, 23, 52, 53, 97, 142, 534, 944, 950, 3806, 4782 (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.

LINKS

Table of n, a(n) for n=1..15.

E. G. Belaga and M. Mignotte, Cyclic Structure of Dynamical Systems Associated with 3x+d Extensions of Collatz Problem, Preprint math. 2000/17, Univ. Louis Pasteur, Strasbourg (2000).

E. G. Belaga and M. Mignotte, Walking Cautiously into the Collatz Wilderness: Algorithmically, Number Theoretically, Randomly, Fourth Colloquium on Mathematics and Computer Science, DMTCS proc. AG. (2006), 249-260.

E. G. Belaga and M. Mignotte, The Collatz Problem and Its Generalizations: Experimental Data. Table 1. Primitive Cycles of (3n+d)-mappings, Preprint math. 2006/15, Univ. Louis Pasteur, Strasbourg (2006).

CROSSREFS

k = A226664(n).

Cf. A226613, A226679.

Sequence in context: A116453 A046578 A046590 * A023521 A113805 A160722

Adjacent sequences:  A226660 A226661 A226662 * A226664 A226665 A226666

KEYWORD

nonn

AUTHOR

Geoffrey H. Morley, Jun 15 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 19 05:33 EDT 2019. Contains 324218 sequences. (Running on oeis4.)