Eulerian polynomial (source code)

= Eulerian polynomial
{c}
{title2=$A_n(t)$}

The <Eulerian polynomial> packages the <Eulerian numbers> as
$$
A_n(t)=\sum_{\pi\in S_n}t^{\operatorname{des}(\pi)}=\sum_{k=0}^{n-1}A(n,k)t^k\quad(n\geq1),
\qquad A_0(t)=1.
$$
Here $\operatorname{des}(\pi)$ counts <permutation descents>. For example, $A_3(t)=1+4t+t^2$. In particular $A_n(1)=n!$, because setting every weight to one counts all <permutations>. The <Eulerian number> recurrence gives $A_n(t)=(1+(n-1)t)A_{n-1}(t)+t(1-t)A'_{n-1}(t)$ for $n\geq1$. Conventions using $t^{\operatorname{des}(\pi)+1}$ multiply this <polynomial> by $t$.