I picked this up from a Reddit post and a corresponding TED-Ed video about Pascal's triangle.
There was a fact in that video that surprised me. There were more but I had figured those out already. Link to the video here. https://youtu.be/XMriWTvPXHI
Eliminating all odd numbers in the Pascal's triangle yields a fractal, more specifically Sierpinski's triangle. I tried to wrap my head around that fact but I couldn't.
Is it possible to tell what patterns form from binomial coefficients that aren't divisible by $2$ and how do these patterns repeat ever so symmetrically. That's my question. Any help would be appreciated.
Each dot is a number in the triangle.