My goal is to find, in any arbitrary dimension, how many linear independent vectors there are in the set made of all of the possible vectors in N whose components sum to a fixed value.
$$A= \lbrace(x_0,x_1, \ldots, x_n): x_i\in \mathbb{N}\hspace{5pt}\left| \hspace{5pt}\sum x_i\leq c\right. \rbrace$$
given the defintion of $A$, the number of all possible vectors in the 2-dimensional case is $x(x-1)/2$, if $c=4$ then $A=\lbrace \\ (0,0)(0,1)(0,2)(0,3)(0,4)\\ (1,0)(1,1)(1,2)(1,3)\\ (2,0)(2,1)(2,2)\\ (3,0)(3,1)\\ (4,0)\rbrace$
For my purpose i would like to know which vectors are not multiples of other vectors in terms of tuple values. Where $(2,2)$ is a multiple of $2\cdot(1,1)$ as my interested in the ratio between the values, $(0.5,0.5)$ in this case or ratio of (0,1) for $(0,1),\ldots,(0,x)$. But i'm not interested in knowing that $(2,1) = 2\cdot(1,0)+(0,1)$
is it possible to deduce a general formula?