By a distinct partition, I mean a partition into distinct parts, i.e., $10 = 5+4+1$ is one, but $10=6+2+2$ is not. The number of distinct partitions of $k$ all whose parts are at most $n$ is given by the sequence https://oeis.org/A053632. The link already provides the generating function as well as a recursive formula.
Now, I am interested in higher dimensional distinct partition. By an $q$-dimensional distinct partition of $k$, I mean a sum
$$k = \sum_{i_1,\cdots,i_q} \lambda_{i_1,\cdots,i_q}$$
for positive integers $\lambda_{i_1,\cdots,i_j,\cdots,i_q}$ such that $\lambda_{i_1,\cdots,i_q} < \lambda_{i_1,\cdots,i_j+1,\cdots,i_q}$ for every $j$.
What is known about the number of distinct $q$-dimensional partitions of $k$ into parts of size at most $n$?
Edit: Because that was maybe not clear: I'm aware that 1-, 2- and 3-dimensional partitions are ordinary, plane and solid partitions, respectively, and that there is an abundance of literature about them. However, I am interested in partitions into distinct parts as defined above. For example, the plane partition example on Wikipedia is not a partition into distinct parts. This case seems to be less covered, and I'm asking for literature about that.