Gaussian binomial coefficient recurrence ($G_{n,k}(t)=G_{n-1,k}(t)+t^{n-k}{G}_{n-1,k-1}(t)$)

For $n\ge 1$ and $1\le k\le n$, the displayed recurrence relation uses $G_{n,0}(t)=1$ and $G_{n,k}(t)=0$ when $k<0$ or $k>n$. At $t=1$ it becomes Pascal's identity.

An exact weighted-subset formula isThe exponent measures how far the selected positions lie beyond the earliest possible choices $0,\dots ,k-1$. Split the subsets according to whether they contain $n-1$. Those without it give $G_{n-1,k}(t)$; deleting it from those with it removes exactly $n-k$ from their exponent. This gives the displayed recurrence relation, explaining why it builds polynomials with nonnegative integer coefficients.