Let's try something a little more graphical. Let's write the integers, starting with 1 and going in order, and array them into a rectangular shape. Then, we'll shade all the nonprime numbers, so that the prime numbers stand out and perhaps reveal their patterns to us at a glance.

When we put the integers in a 2column wide rectangle, it quickly becomes obvious that with one exception, all numbers in the second column will be shaded. This means that other than 2, all prime numbers are odd. But we already knew that. No other pattern seems to emerge here. 

When we put the integers in a 3column wide rectangle, it quickly becomes obvious that with one exception, all numbers in the third column will be shaded. That's because they're multiples of 3. That's a nobrainer, and it also tells us that almost, if not all, the numbers this kind of arrangements will be shaded. Besides that, there seems to be a pattern: the prime numbers form a sort of checkerboard pattern. The checkerboard is here broken by 25, 35 and 49. If you read Part I, you may recall that these are some of the numbers that broke the pattern for the formula 6n +/ 1. If we extend this 3column wide arrangement, we'd likely find that the checkerboard is broken by the same kind of numbers that break the 6n +/ 1 formula. 

In the 5column wide arrangement, we see diagonals running from the first column to the fourth column. The diagonals start on a prime p = 10n + 1 and end on a prime p = 10n  1. 49, 77 and 91 break the pattern. 

In the 7column wide arrangement, we see more diagonals, but this time, they run northeastsouthwest instead of northwestsoutheast. 25, 55, 65, 85, 95, 115, 121, 125, 143 and 145 break the pattern. 