Padé approximations to the logarithm II: Identities, recurrences, and symbolic computation
Combinatorial identities that were needed in [\textit{J. A. C. Weidemann}, Quaest. Math. 28, No. 3, 375--390 (2005; Zbl 1085.41011)] are proved, mostly with C. Schneider's computer algebra package Sigma. The form of the Padé approximation of the logarithm of arbitrary order is stated as a conjecture.
scientific article; zbMATH DE number 5070729