Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

3
  • $\begingroup$ It would be even better to get an expansion of $f_n$ at $x=1$ by the Lagrange Inversion Formula, but that leads to a residue which is not easy at all to compute, as it is for the above expansion at $x=0$. $\endgroup$ Commented Jan 3, 2014 at 22:34
  • $\begingroup$ Thanks, this is very helpful! Although, for my application, I'm going to need an expansion at the point $x=1$. $\endgroup$ Commented Jan 3, 2014 at 22:42
  • $\begingroup$ For an expansion at $x=1$, you can also write $f_n(x)=3+\sum_{k=1}c_{n,k}(x-1)^k$ and find the coefficients recursively, by equating the series $$\frac{1}{2}(f_n-1)(2f_n-5)^n-1=x-1$$. If you only need few terms that should be fine. $\endgroup$ Commented Jan 3, 2014 at 22:57