Take the relation to the GCD triangle http://oeis.org/A054521
At GCD(n,k)!=1 all numbers are divisible by GCD(n,k) therefore contains no prime
At GCD(n,k)==1 we have https://en.wikipedia.org/wiki/Dirichlet%27s_theorem_on_arith... - so those series contain infinitely many primes - and seems like they actually contain at least one prime in all the pixels of the first N rows (but this should be explained/proved, if it is always true for any chosen N, or just happen to be true for the N-s tried by the OP)