A note on the reducibility of special infinite series

作者:

Highlights:

摘要

In this article we present how to reduce the evaluation of the special infinite series Sn=∑∞k=1kn(k+1)!, n=1,2,3,… which are very time consuming in Computer Algebra Systems (CAS). An algorithm is given for this purpose. Based on the new algorithm, a fast and reliable MAPLE procedure is designed and S1,S2,…,S50 are given as sample output of this procedure together with the cpu time.

论文关键词:Stirling numbers,Bell numbers,Algorithm,Series,Computer algebra systems

论文评审过程:Available online 12 March 2004.

论文官网地址:https://doi.org/10.1016/j.amc.2003.12.115