# geek-streak

### Solving the Cake Series

In the previous post about hypercake numbers, we obtained a recurrence relation for the hypercake number:

[c_{m,n} = c_{m,n-1} + c_{m-1,n-1}]

with $$c_{m,1} = 2$$ and $$c_{1,m} = m+1$$.

To move forward, some basic understanding of generating functions1 and binomial coefficients2 is required.