Color each entry of Pascal's triangle by its remainder mod n. When n is prime, you get Sierpinski-like self-similar patterns (Kummer's theorem). Non-prime n produces qualitatively different structures.
2128
Hover to see value | n=2 gives Sierpinski triangle