binomial
The figure represents the first 128 rows of Pascal's triangle. The coefficients in the triangle that are odd are displayed as red boxes. The coefficients in the triangle that are even are displayed as black boxes.
To understand why Pascal's triangle mod 2 resembles the Sierpinski gasket, let P_{n} denote the first 2^{n} rows of the triangle and consider what happens in going from P_{n} to P_{n+1}.

Here are the first 8 rows of Pascal's triangle. Notice that it has the identical pattern in each of the three corners which surround a black triangle of even numbers. 

Here we see that the three corners of P_{4} contain identical copies of P_{3} each scaled by 1/2, surrounding a solid black triangle of even numbers. 

Again, the three corners of P_{5} contain identical copies of P_{4} each scaled by 1/2, surrounding a solid black triangle of even numbers. 

The three corners of P_{6} contain identical copies of P_{5} each scaled by 1/2, surrounding a solid black triangle of even numbers. 
The odd binomial coefficients form a discrete variant of the Sierpinski gasket in which the iterative process of going from one stage to the next is the same as with the gasket: make 3 copies, each scaled by 1/2, and translate to the appropriate corner. In the "limit", the Pascal triangle with an infinite number of rows would have the same selfsimilarity property as the Sierpinski gasket.
Here is a proof of the mathematical justification for this behavior.