Affordable Access

Fountains, histograms, and q-identities

Authors
  • Paule, Peter
  • Prodinger, Helmut
Publication Date
Jan 01, 2003
Source
HAL-UPMC
Keywords
Language
English
License
Unknown
External links

Abstract

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.

Report this publication

Statistics

Seen <100 times