When considering the divisibility of binomial coefficients,
it is very instructive to also look at q-binomial coefficients.

The q-bimonal coefficient are polynomials in <i>q</i> defined by the formula ${{\textstyle a} \choose {\textstyle b}}_q = \frac{{\textstyle a}\underset{\textstyle .}q}{{\textstyle b}\underset{\textstyle .}q{\textstyle (a-b)}\underset{\textstyle .}q}$,<br>
where ${\textstyle n}\underset{\textstyle .}{\scriptstyle q}:=(1-q)(1-q^2)(1-q^3)\ldots (1-q^n)$ denotes the <i>q</i>-factorial.
They satisfy ${{\textstyle a} \choose {\textstyle b}}_q | _ { q = 1 } = {{\textstyle a} \choose {\textstyle b}}$.<br>
The symbol is a "q" with a dot under it, to remind us of the "!" symbol.
It's maybe not the most standard notation, but I find it irresistibly cute.
See <a href="https://mathworld.wolfram.com/q-BinomialCoefficient.html">here</a> for a more detailed exposition, with somewhat more standard notations.

Just like integer numbers can be factorized into primes, polynomials can be factored into irreducible polynomials. The polynomials that occur in the factorization of quantum binomial coefficients are the so-called cyclotomic polynomials &phi;<sub>n</sub>(<i>q</i>), of which there is one for every natural number <i>n</i>.
For your problem, the relevant fact about cyclotomic polynomials is that &phi;<sub>n</sub>(1) is easy to compute. It's <i>p</i> when <i>n</i>= <i>p<sup>a</sup></i> for some prime numer <i>p</i>, and it's 1 otherwise.
So if you have a factorization of some q-binomial coefficient into cyclotomic polynomials,
you can deduce the prime number factorization of the corresponding usual binomial coefficients by plugging in <i>q</i>=0.

Now, unlike for the usual binomial coefficients, the factorization of q-bimonal coefficient
is multiplicity-free: no exponents! Moreover, it is much more easy to determine when &phi;<sub>n</sub> divides 
${{\textstyle a} \choose {\textstyle b}}$: that happens if and only if
(remainder of <i>b</i> modulo <i>n</i>) + (remainder of (<i>a</i>-1) modulo <i>n</i>) + 1 < <i>n</i>.
The latter condition corresponds to a pattern of triangles that is much more regular than the pictures you posted above.
You obtain your picture by superimposing the various patterns I just described.