There is endless number of surprising features in a Pascal's Triangle.
One of them is the following theorem, for you to prove:
The number of odd entries in row N of Pascal's Triangle is 2^k.

Bonus: How does k relate to the number of ones in the binary expansion of the number N?