Discrete Mathematics & Theoretical Computer Science, Vol 6, No 1 (2003)

Font Size:  Small  Medium  Large

Fountains, histograms, and q-identities

Peter Paule, Helmut Prodinger


We solve the recursion Sn=Sn-1-qnSn-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.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page