A350807 -id:A350807 - cp's OEIS frontend

A350806 The maximum value reached when starting at n for the iteration map A350805(n).

1, 2, 1385, 4, 16, 160, 1385, 1385, 32, 1385, 160, 12, 268, 1385, 124, 16, 1385, 32, 268, 32, 32, 1385, 1385, 268, 32, 124, 30, 268, 124, 30, 1385, 32, 1385, 160, 1385, 1385, 124, 1385, 1385, 268, 124, 1385, 1385, 1385, 1385, 1385, 1385, 1385, 1385, 1385, 1385, 1385, 160, 1385, 1385, 56, 1385

Offset: 1

Scott R. Shannon, Jan 17 2022

nonn

For smaller values of n a maximum value of 1385 is common; this is similar to the value 9232 for the standard Collatz map. See A025586.

A graph of the terms looks similar to those of A336957 and A098550. See the linked image.

			a(6) = 160 as the map A350805(6) gives 6 -> 11 -> 34 -> 53 -> 160 -> 21 -> 32 -> 5 -> 16 -> 4 -> 2 -> 1, the maximum value of which is 160.

Scott R. Shannon, Image of the first 10 million terms.

Cf. A350805, A025586, A006370, A027746, A350807, A006577, A000040, A336957, A098550.

A350805 Number of iterations to reach 1 or a repeated value when starting at n for the map: x -> Sum_{prime factors of x} A006370(x), where A006370 is the Collatz 3x+1 map.

Original entry on oeis.org

0, 1, 35, 2, 4, 11, 31, 36, 9, 34, 10, 1, 19, 32, 5, 3, 33, 7, 17, 8, 6, 30, 31, 20, 6, 5, 2, 21, 9, 2, 30, 5, 30, 9, 30, 30, 7, 30, 30, 18, 5, 31, 30, 30, 31, 38, 38, 33, 31, 30, 33, 32, 8, 30, 31, 7, 30, 16, 30, 22, 36, 32, 32, 12, 8, 32, 34, 30, 10, 30, 37, 32, 34, 30, 32, 23, 8, 34, 34

Offset: 1

Scott R. Shannon, Jan 17 2022

nonn

The map sums the values of the Collatz 3x+1 map for each of the prime factors of the input value. Therefore any prime factor 2 adds one to the sum while any other prime factor p adds 3*p+1. See the Examples below.
An examination of the first 10^9 terms shows about 22.8% of all starting values go to 1. The majority, about 68.2%, go into a thirty-member loop with a lowest value 22 and a highest value 1385. About 7.5% go into a five-member loop with lowest value 15 and highest value 124, while about 1.4% go into a two-member loop with values 27 and 30. The remaining terms, about 0.009%, go to 12 which maps to itself. It is possible these four loops are the only ones for all starting values, although this is unknown. See A350807 for the loop values.
In the same range the starting value with the most iterations before reaching 1 or repeating is 622074454, which goes into the thirty-member loop and repeats 22 after sixty-three iterations. See A350806 for the largest value reached starting from n. The starting value with the largest ratio of maximum value reached to starting value is 19762559 which reaches 24311654278 after nine iterations, a ratio of about 1230. Note that after three more iterations its value has reduced to 95.

			a(2) = 1 as 2 -> 1 in the 3x+1 map, which then has no further prime factors.
a(3) = 35 as 3 -> 10 -> 17 -> 52 -> 42 -> 33 -> 44 -> 36 -> 22 -> 35 -> 38 -> 59 -> 178 -> 269 -> 808 -> 307 -> 922 -> 1385 -> 848 -> 164 -> 126 -> 43 -> 130 -> 57 -> 68 -> 54 -> 31 -> 94 -> 143 -> 74 -> 113 -> 340 -> 70 -> 39 -> 50 -> 33, which repeats (33) after thirty-five iterations. This is the first number to enter the thirty-member loop.
a(5) = 4 as 5 -> 16 -> 4 -> 2 -> 1.
a(12) = 1 as 12 -> 12. The prime factorization of 12 is 2*2*3, which maps to 1,1,10, and 1+1+10 = 12. This is the only known fixed point/one-term loop.
a(15) = 5 as 15 -> 26 -> 41 -> 124 -> 96 -> 15, which repeats (15) after five iterations. This is the first number to enter the five-member loop.
a(27) = 2 as 27 -> 30 -> 27, which repeats (27) after two iterations. This is the first number to enter the two-member loop.
a(4096) = 2 as 4096 -> 12 -> 12, which repeats (12) after two iterations. This is the first value, other than 12, that ends at 12.

Cf. A006370, A027746, A350806, A350807, A006577, A000040.

cp's OEIS Frontend

A350806 The maximum value reached when starting at n for the iteration map A350805(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs