Given a function $f = ax - by + 0c$, with constraints $y\geq 0$, $x\geq 0$, $c\geq 0$, and $x+y+c=n$, where all are integers. I am interested to find the count of all unique values of $f$.
I know that total number of different arrangements of $a$, $b$, $c$ are $(n+1)(n+2)/2$. But how do I know how many these arrangements have same value of $f$?