Pascal's Triangle

The formula for the sum of row x in Pascal's Triangle is 2^x, and the value of each position y across in that row is xCy.

Every row beginning with a prime has only multiples of that prime in the row.

If you go down diagonally from each one in a sort-of 'knight's pattern', like in chess, and add up the numbers, you get the Fibonacci sequence.

The diagonals from the ones in the third row have triangular numbers, and if you add each adjacent one, you get square numbers.

If every odd number is colored in in an infinitely big Pascal's Triangle, you get Sierpinski's Triangle.

The contents of each row are powers of 11, with some of the contents smushed up and added together.

Stay coolio,
John