Fountains, histograms, and q-identities
Peter Paule, Helmut Prodinger · Discrete Mathematics & Theoretical Computer Science · 2003
We solve the recursion S_n=S_n-1-q^nS_n-p, both, explicitly, and in the limit for n→∞, proving in this way a formula due to Merlini and Sprugnoli. It is also discussed how computer algebra could be applied.