One way to get an approximation of a Sierpinski triangle is to look at the first 2n rows of Pascal's triangle modulo 2 (that is, draw a black pixel for every odd number, and a white pixel for every even number. It's amusing to work out why this must be true (you could start by showing that C2n-1,k is always odd).