Generate binomial table

Uses a recursion relation to generate all the binomial coefficients nchoosek(n,k) for a range n<=nmax, k<= n. This is much faster than using nchoosek to make this table.

The idea of this function is to be used when you have to evaluate large sums involving binomial coefficients, generating this table and sampling it would be much quicker than generating elements on the fly.

For this reason there is an inbuilt option that if the function is given two parameters it will generate a table of log(nchoosek) which is useful if it appears in summations where nchoosek may evaluate to inf.