This one-liner will calculate the N^{th} number of the R^{th} row of Pascal's triangle (removing the N will make a list of the entire row). I was wondering if it should go on the Math One-Liners page, considering the only thing there right now is a primality routine.

`2^Rbinompdf(R,.5,N)`

Note: The single 1 at the top of Pascal's triangle is considered the 0^{th} row. The first 1 in every row is considered the 0^{th} entry.

EDIT: I just realized that this could be accomplished much more simply by using R nCr N. Not really much of a routine.

The solution to a complex problem is often a simple answer.