A226613 -id:A226613 - cp's OEIS frontend

A226607 Irregular array read by rows in which row floor(k/3)+1, where gcd(k,6)=1, lists the smallest elements, in ascending order, of conjecturally all primitive cycles of positive integers under iteration by the 3x+k function.

1, 1, 19, 23, 187, 347, 5, 1, 13, 1, 131, 211, 227, 251, 259, 283, 287, 319, 1, 23, 5, 5, 7, 41, 7, 17, 1, 11, 3811, 7055, 13, 13, 17, 19, 23, 29, 1, 1, 5, 25, 65, 73, 85, 89, 101, 25, 103, 1, 7, 41, 1, 133, 149, 181, 185, 217, 221, 1, 235, 19, 17, 29, 31, 2585, 2809, 3985, 4121, 4409, 5, 19, 47, 1, 1, 7, 233, 265

Offset: 1

Geoffrey H. Morley, Jun 13 2013

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.
Lagarias (1990) called a T_k cycle primitive if its elements are all relatively prime to k or, equivalently, if its elements are not a common multiple of the elements of another cycle. He conjectured that, for every positive integer k relatively prime to 6, there is at least one primitive cycle of the map T_k and that the number of such cycles is finite.
For k<158195 no trajectory with a starting value below 10^8 has a primitive cycle whose minimal element exceeds 28306063 (attained when k=103645). This suggests that the 42757 primitive cycles found for k<20000, by examining every trajectory with a starting value below 10^8, are complete. Their largest minimal element is 8013899 (when k=17021).

			The irregular array starts:
  (k=1)  1;
  (k=5)  1, 19, 23, 187, 347;
  (k=7)  5;
  (k=11) 1, 13;
a(7)=5 is the smallest number in the primitive 3x+7 cycle {5,11,20,10}.

Geoffrey H. Morley, Rows 1..6667 of array, flattened
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).
E. G. Belaga and M. Mignotte, The Collatz Problem and Its Generalizations: Experimental Data. Table 2. Factorization of Collatz Numbers 2^l-3^k, Preprint math. 2006/15, Univ. Louis Pasteur, Strasbourg (2006).
J. C. Lagarias, The set of rational cycles for the 3x+1 problem, Acta Arith. 56 (1990), 33-53.

Row n begins with a(A226612(n)) and has length A226613(n).
The smallest starting value whose trajectory includes a(n) is A226611(n). The cycle associated with a(n) has length A226609(n) and A226610(n) odd elements of which A226608(n) is the largest.
Cf. A226623.

For 0

A226609 Irregular array read by rows. a(n) is the length of the primitive Collatz-like 3x+k cycle associated with A226607(n).

Original entry on oeis.org

2, 3, 5, 5, 27, 27, 4, 6, 14, 4, 24, 8, 8, 8, 8, 8, 8, 8, 7, 31, 11, 5, 5, 43, 16, 8, 5, 17, 65, 65, 23, 8, 8, 6, 6, 6, 20, 11, 18, 28, 7, 7, 7, 7, 7, 38, 29, 12, 6, 28, 28, 10, 10, 10, 10, 10, 10, 6, 66, 24, 30, 10, 10, 27, 27, 27, 27, 27, 12, 60, 15, 38

Offset: 1

Geoffrey H. Morley, Jun 13 2013

			The irregular array starts:
(k=1)  2;
(k=5)  3, 5, 5, 27, 27;
(k=7)  4;
(k=11) 6, 14;
a(2)=3 is the length of the 3x+5 cycle {1,4,2} associated with A226607(2)=1.

Geoffrey H. Morley, Rows 1..2032 of array, flattened

Row n begins with a(A226612(n)) and has length A226613(n).
The cycle associated with a(n) has A226610(n) odd elements of which A226608(n) is the largest.
Cf. A226611, A226625, A226670-A226672.

A226612 Index of the first element of row n of A226607.

Original entry on oeis.org

1, 2, 7, 8, 10, 19, 21, 22, 25, 27, 31, 32, 34, 37, 38, 39, 46, 47, 48, 51, 58, 60, 61, 62, 69, 72, 73, 77, 80, 81, 82, 85, 88, 90, 97, 99, 100, 101, 102, 104, 109, 111, 115, 117, 120, 122, 127, 128, 131, 134, 136, 138, 139, 140, 144, 146, 149, 151, 153, 160

Offset: 1

Geoffrey H. Morley, Jun 13 2013

nonn

Geoffrey H. Morley, Table of n, a(n) for n = 1..6667

a(n) is also the index of the first element of row n in A226608 to A226611.

Cf. A226613, A226628.

A226629 a(n) is the conjectured number of primitive cycles of positive integers under iteration by the Collatz-like 3x-k function, where k=A226630(n).

Original entry on oeis.org

3, 1, 2, 1, 8, 1, 1, 1, 1, 3, 1, 1, 2, 1, 3, 1, 2, 5, 35, 2, 1, 2, 1, 6, 9, 136, 1, 1, 4, 2, 1, 1, 16, 3, 8, 8, 1, 9, 1, 2, 1, 16, 7, 9, 1, 1, 1, 26, 21, 13, 3, 4, 3, 2, 2, 38, 4, 2, 29, 3, 1, 1, 1, 1, 1, 5, 1, 3, 1, 1, 8, 8, 1, 34, 33, 3, 1, 3, 1, 1, 1, 96, 4

Offset: 1

Geoffrey H. Morley, Jun 13 2013

nonn

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.

Geoffrey H. Morley, Table of n, a(n) for n = 1..600

a(n) is the number of terms in the n-th row of A226623 to A226627.

Cf. A226613, A226679.

a(n) = A226628(n+1) - A226628(n).

A226610 Irregular array read by rows. a(n) is the number of odd elements in the primitive 3x+k cycle associated with A226607(n).

Original entry on oeis.org

1, 1, 3, 3, 17, 17, 2, 2, 8, 1, 15, 5, 5, 5, 5, 5, 5, 5, 2, 18, 5, 2, 2, 26, 8, 4, 1, 9, 41, 41, 12, 4, 4, 3, 3, 3, 8, 3, 7, 16, 4, 4, 4, 4, 4, 22, 17, 4, 2, 16, 11, 6, 6, 6, 6, 6, 6, 1, 41, 12, 16, 5, 5, 17, 17, 17, 17, 17, 4, 32, 8, 16, 20, 20, 14, 14

Offset: 1

Geoffrey H. Morley, Jun 13 2013

			The irregular array starts:
(k=1)  1;
(k=5)  1, 3, 3, 17, 17;
(k=7)  2;
(k=11) 2, 8;
a(2)=1 is the number of odd elements in the 3x+5 cycle {1,4,2} associated with A226607(2)=1.

Geoffrey H. Morley, Rows 1..2032 of array, flattened

Row n begins with a(A226612(n)) and has length A226613(n).
The cycle associated with a(n) has length A226609(n) and its largest element is A226608(n).
Cf. A226611, A226626.

A226608 Irregular array read by rows. a(n) is the largest element in the primitive Collatz-like 3x+k cycle associated with A226607(n).

Original entry on oeis.org

1, 1, 49, 37, 2773, 3397, 11, 7, 79, 1, 1853, 1121, 797, 665, 905, 653, 761, 557, 5, 181, 35, 19, 11, 1651, 137, 41, 1, 121, 2277097, 1051393, 131, 127, 79, 89, 53, 65, 157, 23, 43, 643, 331, 223, 211, 259, 175, 1409, 757, 71, 19, 827, 139, 1399, 775, 751, 967, 559, 571

Offset: 1

Geoffrey H. Morley, Jun 13 2013

			The irregular array starts:
(k=1)  1;
(k=5)  1, 49, 37, 2772, 3397;
(k=7)  11;
(k=11) 7, 79;
a(3)=49 is the largest element in the 3x+5 cycle {19,31,49,76,38} associated with A226607(3)=19.

Geoffrey H. Morley, Rows 1..2032 of array, flattened

Row n begins with a(A226612(n)) and has length A226613(n).
The cycle associated with a(n) has length A226609(n) and A226610(n) odd elements.
Cf. A226611, A226624, A226667-A226669.

A226611 Irregular array read by rows. a(n) is the smallest starting value of a T_k trajectory that includes A226607(n), where T_k is the 3x+k function associated with A226607(n).

Original entry on oeis.org

1, 1, 3, 23, 123, 171, 1, 1, 3, 1, 19, 99, 147, 163, 123, 283, 159, 319, 1, 9, 1, 5, 7, 1, 1, 3, 1, 3, 2531, 5859, 1, 1, 3, 1, 3, 7, 1, 1, 5, 1, 9, 33, 39, 21, 101, 1, 1, 1, 7, 9, 1, 3, 149, 21, 93, 125, 221, 1, 175, 1, 1, 1, 7, 2585, 1073, 2301, 4121, 893

Offset: 1

Geoffrey H. Morley, Jun 13 2013

			The irregular array starts:
(k=1)  1;
(k=5)  1, 3, 23, 123, 171;
(k=7)  1;
(k=11) 1, 3;
a(3)=3 is the smallest starting value for a 3x+5 trajectory that includes A226607(3)=19. The trajectory is {3,7,13,22,11,19,...}.

Geoffrey H. Morley, Rows 1..2032 of array, flattened

Row n begins with a(A226612(n)) and has length A226613(n).
The cycle associated with a(n) has length A226609(n) and A226610(n) odd elements of which A226608(n) is the largest.
Cf. A226627.

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.

Original entry on oeis.org

1, 5, 9, 19, 20, 23, 52, 53, 97, 142, 534, 944, 950, 3806, 4782

Offset: 1

Geoffrey H. Morley, Jun 15 2013

nonn

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.

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

k = A226664(n).

Cf. A226613, A226679.

A226662 Smallest positive integer k (or 0 if no such k) with conjecturally exactly n primitive cycles of positive integers under iteration by the Collatz-like 3x+k function.

Original entry on oeis.org

1, 11, 23, 29, 5, 247, 47, 229, 13, 361, 359, 517, 481, 1669, 485, 1843, 295, 269, 233, 355, 2509, 1399, 431, 943, 1991, 4715, 7469, 3323, 1753, 2777, 781, 2347, 1201, 4741, 9233, 12607, 6559, 6721, 4879, 2359, 5531, 1805, 11773, 11113, 6755, 8861, 5897, 30079

Offset: 1

Geoffrey H. Morley, Jun 25 2013

nonn

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.
Belaga and Mignotte (2000, p.19) conjectured that the number of primitive cycles attains all positive integer values.

Geoffrey H. Morley, Table of n, a(n) for n = 1..189
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).

Cf. A226613, A226678.

Showing 1-9 of 9 results.

cp's OEIS Frontend

A226607 Irregular array read by rows in which row floor(k/3)+1, where gcd(k,6)=1, lists the smallest elements, in ascending order, of conjecturally all primitive cycles of positive integers under iteration by the 3x+k function.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A226609 Irregular array read by rows. a(n) is the length of the primitive Collatz-like 3x+k cycle associated with A226607(n).

Views

Author

Keywords

Examples

Links

Crossrefs

A226612 Index of the first element of row n of A226607.

Views

Author

Keywords

Links

Crossrefs

A226629 a(n) is the conjectured number of primitive cycles of positive integers under iteration by the Collatz-like 3x-k function, where k=A226630(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A226610 Irregular array read by rows. a(n) is the number of odd elements in the primitive 3x+k cycle associated with A226607(n).

Views

Author

Keywords

Examples

Links

Crossrefs

A226608 Irregular array read by rows. a(n) is the largest element in the primitive Collatz-like 3x+k cycle associated with A226607(n).

Views

Author

Keywords

Examples

Links

Crossrefs

A226611 Irregular array read by rows. a(n) is the smallest starting value of a T_k trajectory that includes A226607(n), where T_k is the 3x+k function associated with A226607(n).

Views

Author

Keywords

Examples

Links

Crossrefs

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.

Views

Author

Keywords

Comments

Links

Crossrefs

A226662 Smallest positive integer k (or 0 if no such k) with conjecturally exactly n primitive cycles of positive integers under iteration by the Collatz-like 3x+k function.

Views

Author

Keywords

Comments

Links

Crossrefs