Here's one way to bolster this mathematically just a bit.<p>If you have a composite number C, you can use C to guarantee factors in larger numbers. If k is a factor of C, Cn + k also has a factor of k.<p>So, for a "highly-composite" C, you rule out many prime numbers. An easy way to generate these "highly composite" numbers is to multiple the first few primes. For example,<p>C = 2 * 3 = 6.<p>* 6n + 0 has factors of 2, 3, 6<p>* 6n + 1 may be prime (e.g. 7)<p>* 6n + 2 has factors of 2<p>* 6n + 3 has factors of 3<p>* 6n + 4 has factors of 2<p>* 6n + 5 may be prime (e.g., 17)<p>I'll call the possibly-prime numbers C-primes. So 6n+1 and 6n+5 are 6-primes. Similarly, we have 6n+0 is a 6-tween, and 6n+2 and 6n+4 are 6-nexts (next to exactly one 6-prime), and 6n+3 is a 6-non (not adjacent to any 6-primes).<p>So, the 6-tweens have at least 2 factors, the 6-nons have at least 1 factor, and 6-nexts have at least 1 factor.<p>The number of proper divisors that a number can have is actually bounded fairly tightly [1]. For example, number numbers below 24 have more than 4 divisors; that means the 6-tween behavior predicts _three quarters_ of the divisors a number can have until 24.<p>[1]: <a href="https://terrytao.wordpress.com/2008/09/23/the-divisor-bound/" rel="nofollow">https://terrytao.wordpress.com/2008/09/23/the-divisor-bound/</a><p>You can use a larger C to get information for longer. For example, C = 2 * 3 * 5 = 30 gives<p>* 30n + 0 has divisors 2, 3, 5, 6, 10, 15, 30 -- tween<p>* 30n + 1 may be prime<p>* 30n + 2 has divisors 2 -- next<p>* 30n + 3 has divisors 3<p>* 30n + 4 has divisors 2<p>* 30n + 5 has divisors 5<p>* 30n + 6 has divisors 2, 3, 6 -- next<p>* 30n + 7 may be prime<p>* 30n + 8 has divisors 2 -- next<p>* 30n + 9 has divisors 3<p>* 30n + 10 has divisors 2, 5, 10 -- next<p>* 30n + 11 may be prime<p>* 30n + 12 has divisors 2, 3, 6 -- tween<p>* 30n + 13 may be prime<p>* 30n + 14 has divisors 2 -- next<p>* 30n + 15 has divisors 3, 5, 15<p>* 30n + 16 has divisors 2 -- next<p>* 30n + 17 may be prime<p>* 30n + 18 has divisors 2, 3, 6 -- tween<p>* 30n + 19 may be prime<p>* 30n + 20 has divisors 2, 5, 10 -- next<p>* 30n + 21 has divisors 3<p>* 30n + 22 has divisors 2 -- next<p>* 30n + 23 may be prime<p>* 30n + 24 has divisors 2, 3, 6 -- next<p>* 30n + 25 has divisors 5<p>* 30n + 26 has divisors 2<p>* 30n + 27 has divisors 3<p>* 30n + 28 has divisors 2 -- next<p>* 30n + 29 may be prime<p>So 30-tweens have (7, 3, 3) divisors; 30-nexts have (1, 3, 3, 1, 1, 3, 3) divisors; 30-nons have (1, 1, 1, 1, 3, 1, 1, 1, 1) divisors.<p>The first number to have more than 10 divisors is 120 (with 14), so this predicts 7 of the possible 13 divisors for numbers 30 to 120, all in tween numbers.<p>This makes the problem somewhat more concrete: why do the numbers that have many common factors with C cluster near the numbers with no common factors of C? But since we can at least observe it for different concrete C, this still does predict something about "all" the primes (though the effect of a particular C fades as the number of possible divisors eventually increases >> num. divisors of C; I posit that you can always generate a larger C to extend the pattern, but I don't know number theory to show it)