Recursion formulae of 1<sup>ℓ</sup> + 2<sup>ℓ</sup> + ··· + <i>n</i><sup>ℓ</sup>and their combinatoric meaning in terms of the tree diagrams (Q4920304)
From MaRDI portal
scientific article; zbMATH DE number 6164034
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recursion formulae of 1<sup>ℓ</sup> + 2<sup>ℓ</sup> + ··· + <i>n</i><sup>ℓ</sup>and their combinatoric meaning in terms of the tree diagrams |
scientific article; zbMATH DE number 6164034 |
Statements
Recursion formulae of 1<sup>ℓ</sup> + 2<sup>ℓ</sup> + ··· + <i>n</i><sup>ℓ</sup>and their combinatoric meaning in terms of the tree diagrams (English)
0 references
16 May 2013
0 references
Euler-MacLaurin sum formula
0 references
tree diagram
0 references
