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.
https://hal.inria.fr/hal-00958993
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Soumis le : jeudi 13 mars 2014 - 16:59:37
Dernière modification le : mercredi 29 novembre 2017 - 10:26:23
Document(s) archivé(s) le : vendredi 13 juin 2014 - 12:09:19
Peter Paule, Helmut Prodinger. Fountains, histograms, and q-identities. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2003, 6 (1), pp.101-106. 〈hal-00958993〉
