Computing Andrew's slog solution

[bo198214]

Anyway, I've only tested solutions for the 50-, 60-, 70-, and 80-term truncations. I've noticed that I can speed up the initial matrix solving by about 10-15% if I avoid the rationals created by dividing through by the factorials.

Hm, on Maple solving is quite fast, taking into account that the solving is exact by fractional arithmetic with a symbol for \( \log(b) \). To compute the initial 100 coefficients of the series it needs perhaps a minute.