Eulerian number
(Q1373849)
in combinatorial analysis, coefficients of the sequence of Eulerian polynomials, defined as the number of permutations of the numbers from 1 to n in which m elements are greater than the previous element
in combinatorial analysis, coefficients of the sequence of Eulerian polynomials, defined as the number of permutations of the numbers from 1 to n in which m elements are greater than the previous element
Language:
Current Data About
Eulerian number
| (P31) |
(Q77358734)
|
||||||||
| (P138) |
(Q7604)
|
||||||||
| (P279) |
(Q21199)
|
||||||||
| (P366) |
(Q76592)
|
||||||||
| (P1889) |
(Q1340031)
(Q947015) (Q82435) |
||||||||
| (P2534) |
A(n,m)=\sum_{k=0}^{m+1}(-1)^k \binom{n+1}{k} (m+1-k)^n
A_n(t) = \sum_{m=0}^{n} A(n,m)\ t^{m}
|
||||||||
| (P6104) |
(Q8487137)
|
||||||||
| (P7235) |
A(n, m) = E(n, m) = \left\langle {n \atop m} \right\rangle
\binom{n+1}{k}
\sum_{k=0}^{m+1}
A_n(t)
|
other details
| description | in combinatorial analysis, coefficients of the sequence of Eulerian polynomials, defined as the number of permutations of the numbers from 1 to n in which m elements are greater than the previous element |
External Links
| (P646) |
/m/02p8tfz
|
| (P691) |
ph1203574
|
| (P2812) |
EulerianNumber
|
| (P6366) |
141859694
|