Timeline for Mysterious recursion for the A005225
Current License: CC BY-SA 4.0
2 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 4, 2023 at 7:43 | comment | added | Martin Rubey | So, for $k | n$, we have that $[z^{k-1}] R(n-1, 0, z)$ is the number of permutations of cycle type $(n/k, \dots, n/k)$. | |
Aug 3, 2023 at 17:48 | history | asked | Notamathematician | CC BY-SA 4.0 |