Recursion formulae of \(1^{\ell} +\;2^{\ell} +\dots +\;n^{\ell}\) and their combinatoric meaning in terms of the tree diagrams (Q4920304)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6164034
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recursion formulae of \(1^{\ell} +\;2^{\ell} +\dots +\;n^{\ell}\) 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
0.7660784721374512
0 references
0.7602295279502869
0 references
0.718065083026886
0 references
