Nice. When I was a teenage self-taught programmer, an article like this one, but about the superiority of quicksort to insertion sort, was the trigger that got me to understand that thinking mathematically about algorithms could lead us to a kind of understanding that transcended mere coding (although I couldn&#x27;t have put it in those words at that time). It was quite an epiphany.<p>I can imagine, today, a young enthusiast having learned Python and maybe done a few Project Euler exercises, stumbling upon that post and being amazed that you could generate Fibonacci numbers that way, and thinking that maybe there is something interesting about that &quot;generating functions&quot; thing.<p>If that&#x27;s you reading this, it&#x27;s dangerous to go alone. Take this: <a href="https:&#x2F;&#x2F;www.math.upenn.edu&#x2F;~wilf&#x2F;DownldGF.html" rel="nofollow">https:&#x2F;&#x2F;www.math.upenn.edu&#x2F;~wilf&#x2F;DownldGF.html</a>