Abstract
Let V_n be a set of integer vectors. We enumerate lattice paths that only uses vectors in V_n. Unlike most lattice path enumeration problems, the number of dimensions isn't fixed and the vector set is dependent on the dimension. This requires us to follow a different approach in explicitly expressing the number of lattice paths from origin to any point in $n$-dimensional space. We notice that a special case of this problem corresponds to Fubini numbers, which count the number of weak orderings of a set consisting of $n$ elements. Then, we find the recursive relation of this sequence. Finally, we develop an algorithm that can be used to find the number of paths between any two points that do not touch the lattice points in R. The crucial part of our algorithm is that it doesn't rely on finding all paths and checking each path for usage of restricted points.