You know, how we can have lattice paths, where we can move either one block north, or one block east, and we have the find all the possible ways of reaching the point (x.y) from (0,0).
That is $\binom{x+y}{x}$ paths we can have.
But what if, instead of only being able to move one block at a time, we can move move (1, n) number of blocks at a time, where n is any positive integer (and in the north direction). How many ways are there of going to a point (x, y) with this?