Infinite sum compression using the inverse of [formal power series
[Polynomial and Formal Power Series (2) Derivation of Solutions by Expression Transformation | maspy's HP https://maspypy.com/%e5%a4%9a%e9%a0%85%e5%bc%8f%e3%83%bb%e5%bd%a2%e5%bc%8f%e7%9a%84%e3%81%b9%e3 I have paraphrased a passage from %81%8d%e7%b4%9a%e6%95%b0%ef%bc%88%ef%bc%92%ef%bc%89%e5%bc%8f%e5%a4%89%e5%bd%a2%e3%81%ab%e3%82%88%e3%82%8b%e8%a7%a3%e6%b3%95 to the point where I can to a point where I can understand it.
inverse element
Count up the number of ways to express N as a sum of positive integers. However, distinguish between different orders of sums.
This page is auto-translated from /nishio/形式的べき級数の逆元を使った無限和圧縮 using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I'm very happy to spread my thought to non-Japanese readers.