A343858 -id:A343858 - cp's OEIS frontend

A345228 Square array T(m, n), read by ascending antidiagonals. Let f(k) = k/2 if k is even, otherwise ((2n+1)k + 2*T(m, n) + 1)/2, T(m, n) is the smallest integer greater than -1, where m = f^j(m) for j > 0 exists. f^j(m) means the j-th iterate of f(m).

0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 2, 0, 3, 0, 0, 2, 2, 0, 2, 3, 1, 0, 2, 3, 0, 1, 2, 10, 0, 2, 1, 3, 0, 0, 1, 7, 3, 2, 1, 3, 4, 0, 7, 0, 4, 2, 17, 1, 3, 5, 4, 0, 6, 7, 1, 1, 4, 10, 3, 0, 4, 5, 0, 5, 6, 22, 0, 7, 7, 24, 4, 1, 2, 5, 0, 4, 5, 19, 7, 2, 4, 17, 3, 4, 2

Offset: 0

Thomas Scheuerle, Jun 11 2021

This sequence is an extension of A344583 ( row T(m, 1) ).
From Thomas Scheuerle, Dec 11 2023: (Start)
It was formerly stated that "T(m, n) >= T(1, n) if m > 0". This was wrong and did not consider an important condition which could lead to exceptions. It is interesting that this wrong statement seems to hold for a vast amount of data.
  Known exception: T(1, 90) = 37 but T(27, 90) = 0.
Formerly it was stated that this is a theorem:
 "(T( (1 + 2*n)*m, n) - n)/T(m, n) = 1 + 2*n if T(m, n) > 0."
This appears to be true in the majority of cases, but misses some yet unknown conditions. (End)
The reason for the pattern in the row T(1, n) is that in this particular case a cycle is only possible if we eventually reach a power of 2 under iteration. If we look at the case 9x+1 ( Row 4 ) as an example, we can understand this by the binary representation of 9: 1001. If we multiply any number j by 9 it equals a sum of j and a left-shifted version of j. Example j = 5: 1001*101 = 1001 + 100100 = 101101. In the Collatz operation 9x+1, an interrupted sequence of ones starting at the least significant bit is required to get an uninterrupted sequence of zeros by addition of 1. But in the case 9x+1 starting with x = 1 it is not possible to reach any 2^t-1 (pattern of all ones) because of the large gap of zeros in the binary representation of 9 (1001). By each multiplication, we add a shifted copy of 1001... at the left to the bit pattern and thus add gaps that are only slowly filled up with ones by the addition of the constant. To prevent an escape into infinity, in the Collatz process either the factor needs to have a gap of zeros smaller than two zeros in sequence (compare 9 -> row 4 and 15 -> row 7), or the constant we are adding in this process needs to be big enough to fill this gap quickly, e.g., 9x+7.
A surprising mystery are the many equal elements and correlations between different rows. For many values of m, we may observe T(m, n) = T(m, n+k) for some n and k, even if 1+2*n and 1+2*(n+k) are relatively prime.
A343858 identifies each cycle by the smallest number it may reach. This information can be used to check if two entries with the same value in T(m, n) correspond to the same cycle.
We find with growing n more similarity between T(m, n) and A025480(m - 1), the related sequence A343858(m, n) has in the same fashion similarity to A000265(m).
A173732 is the compressed representation of the dynamics of row n = 1 (3x+1). But also A025480(3*n + 1) = A173732(n) and we see now A025480 connected to generalizations of the Collatz function. This suggests a special role for the original 3x+1 version in this set of functions.

			Twelve initial terms of rows 0-10 are listed below:
   n |m->
   0: 0, 0, 1, 1,  2,  2,  3,  3, 4,  4,  5,  5, ...
   1: 0, 0, 0, 1,  2,  2,  1,  3, 5,  4,  2,  3, ...
   2: 0, 0, 0, 0,  0,  2,  1,  3, 0,  1,  2,  3, ...
   3: 0, 0, 0, 1,  0,  2,  1,  3, 4,  4,  2,  5, ...
   4: 0, 3, 3, 10, 3, 17, 10, 24, 3, 31, 17, 23, ...
   5: 0, 2, 2, 7,  2,  4,  7, 17, 2, 21,  4, 27, ...
   6: 0, 1, 1, 4,  1,  7,  4, 10, 1, 13,  7,  4, ...
   7: 0, 0, 0, 1,  0,  2,  1,  3, 0,  4,  2,  5, ...
   8: 0, 7, 7, 22, 7, 37, 22, 52, 7, 67, 37, 82, ...
   9: 0, 6, 6, 19, 6, 32, 19, 14, 6, 58, 32, 71, ...
  10: 0, 5, 5, 16, 5, 27, 16, 38, 5, 49, 27, 35, ...
We may see this sequence as a sequence of functions:
in m=1: 0 -> f_n1_0(k) =  k/2; (3*k+1)/2.
        1 -> f_n1_1(k) =  k/2; (3*k+3)/2.
        2 -> f_n1_2(k) =  k/2; (3*k+5)/2.
in m=2: 0 -> f_n2_0(k) =  k/2; (5*k+1)/2.
        1 -> f_n2_1(k) =  k/2; (5*k+3)/2.
        2 -> f_n2_2(k) =  k/2; (5*k+5)/2.
T(1, 4) = 3 because: f_n4_3(1) = (9 + 7)/2 = 16, f_n4_3(18) = 16/2 = 8, f_n4_3(8) = 8/2 = 4, f_n4_3(4) = 4/2 = 2, f_n4_3(2) = 2/2 = 1.
This shows that f_n4_3(f_n4_3(f_n4_3(f_n4_3(f_n4_3(1))))) = 1.
T(1, 4) is not < 2 because no such loop which includes 1 exists for f_n4_0, f_n4_1 and f_n4_2.

Thomas Scheuerle, T(1..100,1..20) as 3D surface.
Thomas Scheuerle, T(1..100,1..20) as 3D surface, viewpoint looking as profile, n left->right, m near->far. (Unexpected correlations).
Index entries for sequences related to 3x+1 (or Collatz) problem

Cf. A344583, A035327, A343858, A025480, A173732.

\\ uses magic constant 10^5
isperiodic(v, z) = for (k=1, #v, if (v[k] == z, return(1)));
f(tmn, m, n) = if (m%2, ((2*n+1)*m+2*tmn+1)/2, m/2);
isok(m, n, tmn) = {my(v=[m], y=m); for (i=1, oo, my(z=f(tmn, y, n)); if (z > 10^5, return (0)); if (z == m, return (1)); if (isperiodic(v, z), return(0)); v = concat(v, z); y = z; ); }
T(m,n) = {my(tmn=0); while (!isok(m, n, tmn), tmn++); tmn; }
matrix(15,15, n, k, T(k-1, n-1)) \\ Michel Marcus, Jun 17 2021

T(1, n) = A035327(n) for n > 2.

A359214 a(n) is the least k >= 0 such that A359194^k(A358668(n)) = n (where A359194^k denotes the k-th iterate of A359194).

Original entry on oeis.org

0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 2, 0, 4, 3, 0, 5, 0, 0, 1, 74, 0, 3, 7, 0, 1, 0, 0, 1, 5, 0, 0, 6, 0, 0, 2, 0, 77, 1, 0, 0, 1, 0, 0, 2, 0, 0, 1, 0, 0, 8, 0, 0, 4, 0, 9, 1, 0, 0, 75, 0, 7, 6, 0, 8, 0, 0, 1, 0, 0, 76, 0, 0, 1, 5418, 0, 1, 0, 0, 2, 0, 0

Offset: 0

Rémy Sigrist, Dec 22 2022

			The orbit of 0 under repeated application of A359194 is:
    0, 1, 0, ...
So a(0) = 0, a(1) = 1.
The orbit of 2 under repeated application of A359194 is:
    2, 1, 0, 1, 0, ...
So a(2) = 0.
The orbit of 3 under repeated application of A359194 is:
    3, 6, 13, 24, 55, 90, 241, 300, 123, 142, 85, 0, 1, 0, ...
So a(3) = 0, a(6) = 1, a(13) = 2, a(24) = 3, a(55) = 4, etc.

Rémy Sigrist, Table of n, a(n) for n = 0..10000
Rémy Sigrist, PARI program

Cf. A358668, A359194, A359226.

Cf. A343858 (smallest numbers inside cyclic trajectories of the generalized Collatz function bx+c).

nn = 83; c[] = -1; c[0] = 0; f[n] := FromDigits[BitXor[1, IntegerDigits[3*n, 2]], 2]; Do[(MapIndexed[If[c[#1] == -1, Set[c[#1], First[#2] - 1]] &, #]; -1 + Length[#]) &@ NestWhileList[f, n, c[#] == -1 && # > 1 &], {n, 0, nn}]; Array[c, nn] (* Michael De Vlieger, Dec 23 2022 *)

PARI
```
See Links section.
```

a(n) = 0 iff A358668(n) = n.

a(3*n+2) = 0. - Thomas Scheuerle, Dec 22 2022

cp's OEIS Frontend

A345228 Square array T(m, n), read by ascending antidiagonals. Let f(k) = k/2 if k is even, otherwise ((2n+1)k + 2*T(m, n) + 1)/2, T(m, n) is the smallest integer greater than -1, where m = f^j(m) for j > 0 exists. f^j(m) means the j-th iterate of f(m).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A359214 a(n) is the least k >= 0 such that A359194^k(A358668(n)) = n (where A359194^k denotes the k-th iterate of A359194).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

cp's OEIS Frontend

A345228 Square array T(m, n), read by ascending antidiagonals. Let f(k) = k/2 if k is even, otherwise ((2*n+1)*k + 2*T(m, n) + 1)/2, T(m, n) is the smallest integer greater than -1, where m = f^j(m) for j > 0 exists. f^j(m) means the j-th iterate of f(m).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A359214 a(n) is the least k >= 0 such that A359194^k(A358668(n)) = n (where A359194^k denotes the k-th iterate of A359194).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A345228 Square array T(m, n), read by ascending antidiagonals. Let f(k) = k/2 if k is even, otherwise ((2n+1)k + 2*T(m, n) + 1)/2, T(m, n) is the smallest integer greater than -1, where m = f^j(m) for j > 0 exists. f^j(m) means the j-th iterate of f(m).