Timeline for Proof of a combinatorial equation
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 25, 2018 at 22:40 | comment | added | Fedor Petrov | mentioned where, here or on OEIS? It is not quite the same, but the ratio equals $n$. | |
| Aug 25, 2018 at 21:50 | comment | added | Jingzhe Tang | Thanks for inspiration. It should be the most appropriate interpretation if we focus on combinatorics. By the way, it would be better if it is mentioned that "total height of rooted trees with $n$ labeled nodes" is equal to "total length of directed simple paths of unrooted trees with $n$ labeled nodes". | |
| Aug 25, 2018 at 21:25 | vote | accept | Jingzhe Tang | ||
| Aug 25, 2018 at 20:28 | vote | accept | Jingzhe Tang | ||
| Aug 25, 2018 at 21:23 | |||||
| Aug 22, 2018 at 16:19 | history | edited | Sam Hopkins | CC BY-SA 4.0 |
added URL links to OEIS sequences
|
| Aug 22, 2018 at 16:16 | comment | added | Sam Hopkins | Really nice combinatorial interpretation! | |
| Aug 22, 2018 at 15:58 | history | answered | Fedor Petrov | CC BY-SA 4.0 |