By Lucas' theorem, C(m,n) mod p is non-zero iff each digit of n in base p is ≤ the corresponding digit of m. This produces self-similar Sierpiński patterns for prime p.