In the paper Continued-Fraction Expansions for the Riemann Zeta Function and Polylogarithms by Djurdje Cvijovic and Jacek Klinowski, there is a claim that I cannot reproduce. In the abstract they claim "For example, the 11th approximants for all ζ(n), n ≥ 2, give values with an error of less than 10^(−9)." When I implement the algorithms they describe, however, the 11th approximant for ζ(2) is 1.62328... which has an error of more than 0.02. I have carefully checked that my implementation is correct. I was wondering if anyone has been able to verify this problem?