The following is a purely computational; including a process of converting a generating function to its formal power series relations. This can be also seen as an example of recurrence relation at the 2nd-order with indices coefficient.
Observe a case of ![]()
To determine the
, notice that the k-derivative has a form
![]()
where
and
is a monic polynomial of degree (k-1) with
.
By a calculation, one can see
has an inductive formula
![]()
And
has
![]()
Combining these formula, we have
![]()
First few
and
are as follows.
![Rendered by QuickLaTeX.com \[\begin{center} \begin{tabular}{ l | l | l } \hline k $\backslash$ * & $g_k(t)$ & $a_k$ \\ \hline 0 & $160^{-1}$ & 1 \\ \hline 1 & 1 & 160 \\ \hline 2 & t+80 & 160\cdot 2!\cdot 80 \\ \hline 3 & t^2+160t+4267 & 160\cdot 3!\cdot 4267 \\ \hline 4 & t^3+240t^2+12801t+170720 & 160\cdot 4!\cdot 170720 \\ \hline \end{tabular} \end{center}\]](https://blog.icefog.work/wp-content/ql-cache/quicklatex.com-abcee57abc41cda8600fbb3405262ca9_l3.png)
By close look at the first-order term of
,
holds. Thus there we have recurrence relation determined solely by means of
itself
![]()
![Rendered by QuickLaTeX.com \[\frac{d^n}{dt^n}\big[(1-t)^{-k}(1+(1-k)t)\big]=\begin{cases} -\frac{1}{(1-t)^{k+1}} \big\{ -1+(1-k)^2t \big\} & n=1 \\ -\frac{k}{(1-t)^{k+2}} \big\{ k-3+(1-k)^2t \big\} & n=2 \\ -\frac{k(k+1)}{(1-t)^{k+3}} \big\{ 2k-5+(1-k)^2t \big\} & n=3 \end{cases}\]](https://blog.icefog.work/wp-content/ql-cache/quicklatex.com-64468c6d8e3b639fb4f328ab9c4797de_l3.png)