Sierpinski sieve:

#!/usr/bin/perl -wl
$_="co";
while (1) { s/..(?=c)/$&^"CO"/eg; s/^/ /; print; }
[download]

Now, why does this work? Because binom(m, n)(mod 2) = n XOR m, so this is just Pascal's triangle (mod 2).

Update: Will work now.