A problem of combinatorics (reduced from a problem of computing probability generating function) This is a problem involving computation of probability generating function (PGF).

I have reduced the problem into a problem of combinatorics, as given below.
Let $f(n,k)$ be defined as
$$f(n+1,k):=f(n,k)+f(n,k-1)+\cdots+f(n,k-n)$$
where $f(n,k)=0$ for $k<0$, $f(1,0)=1$ and $f(1,k)=0$ otherwise. To show that
$$\sum_{k=0}^{\infty}s^k f(n,k)=\prod_{k=2}^n \frac{1-s^k}{1-s},\,\, |s|<1$$
Source : Rohatgi, Saleh. p.92. Problem 11. Thanks in advance.

The problem can be rewritten as
$$
\left\{ \matrix{
  f(n,k) = \sum\limits_{0\, \le \,j\, \le \,n - 1} {f(n - 1,k - j)}  \hfill \cr 
  f(n,k) = 0\quad \left| {\,n,k < 0} \right. \hfill \cr 
  f(0,k) = f(1,k) = \left[ {0 = k} \right] \hfill \cr}  \right.
$$
and more compactly as
$$
f(n,k) = \sum\limits_{0\, \le \,j\, \le \,n - 1} {f(n - 1,k - j)}  + \left[ {0 = n} \right]\left[ {0 = k} \right]
$$
where $[P]$ denotes the Iverson bracket
$$
\left[ P \right] = \left\{ {\begin{array}{*{20}c}
   1 & {P = TRUE}  \\
   0 & {P = FALSE}  \\
 \end{array} } \right.
$$
Then let's take the generating function on the index $k$
$$
\eqalign{
  & F(n,x) = \sum\limits_{0\, \le \,k} {f(n,k)\,x^{\,k} }  = \sum\limits_{0\, \le \,j\, \le \,n - 1} {\sum\limits_{0\, \le \,k} {f(n - 1,k - j)\,x^{\,k} } }  + \left[ {0 = n} \right] =   \cr 
  &  = \sum\limits_{0\, \le \,j\, \le \,n - 1} {x^{\,j} \sum\limits_{0\, \le \,k} {f(n - 1,k - j)\,x^{\,k - j} } }  + \left[ {0 = n} \right] =   \cr 
  &  = {{1 - x^{\,n} } \over {1 - x}}F(n - 1,x) + \left[ {0 = n} \right] \cr} 
$$
Thus
$$
\eqalign{
  & F(0,x) = 1  \cr 
  & F(1,x) = {{1 - x^{\,1} } \over {1 - x}} = 1  \cr 
  & F(2,x) = {{1 - x^{\,2} } \over {1 - x}} = {{1 - x^{\,2} } \over {1 - x}}{{1 - x^{\,1} } \over {1 - x}}  \cr 
  & \quad \quad  \vdots   \cr 
  & F(n,x) = \sum\limits_{0\, \le \,k} {f(n,k)\,x^{\,k} }  = \prod\limits_{1\, \le \,\,k\, \le \,n} {{{1 - x^{\,k} } \over {1 - x}}}  \cr} 
$$
$f(n,k)$ is OEIS sequence A008302.
