2 1
3 10 5...
5 is prime.
5 16 8 4 2 1
7 22 11...
11 is prime.
11 22 34 17...
17 is prime.
13 40 20 10 5...
5 is prime.
17 52 26 13...
13 is prime.
19 58 29...
29 is prime.
23 70 35 106 53...
53 is prime.
29 88 44 22 11...
11 is prime.
31 94 47 142 71...
71 is prime.
37 112 56 28 14 7...
7 is prime.
41 124 62 31...
31 is prime.
43 130 65 196 98 49...
49 is semiprime.
47 142 71...
71 is prime.
53 160 80 40 10 5...
5 is prime.
59 178 89...
89 is prime.
61 184 92 46 23...
23 is prime.
67 202 101...
101 is prime.
71 214 107...
107 is prime.
73 220 110 55 166 83...
83 is prime.
79 238 119...
119 is semiprime.
83 250 125 376 188 94 47...
47 is prime.
89 268 134 67...
67 is prime.
97 292 146 73...
73 is prime.
skipping a bit
997 2992 1496 748 374 187...
187 is semiprime with factors of 11 and 17.
9973 29920 14960 7480 3740 1870 935 2806 1403...
1403 is semiprime with factors 23 and 61.
By combining this with the Goldbach Conjecture, we have a new primality test and a way of generating primes. Start with a large even number (100 digits or more) and divide by 2 until you get an odd number. Then use that odd number as a seed for the Collatz conjecture. The first odd result that isn't a multiple of 5 will be either prime or semiprime. I suspect that as for large seeds, the first odd result is more likely to be semiprime than prime.
In this way, it is possible to build up a library of large semiprimes, which eases the integer factorization problem.
What happens if the seed is semiprime?
187 562 281...
281 is prime.
1403 4210 2105 6316 3158 1579...
1579 is prime.
So if we start with a semiprime, we can get an actual prime in a few iterations.
For any given range, there will be somewhat more semiprimes than primes.
