Discrete Mathematics & Theoretical Computer Science (Jun 2003)
Fountains, histograms, and q-identities
Abstract
We solve the recursion S n =S n-1-q n S 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.