> Interesting that you should mention this. See the recent thread here > <https://groups.google.com/forum/#!topic/sympy/5ODQUOlVbCc> where I ask > if there is a better way to compute such things (at least to a novice it > appears that we are talking about the same thing). >
Yes, indeed it is related. In fact the thread you mentioned, actually just explicitly defines the recurrence by giving the rational generating function (=Q(x)/P(x)) of the sequence. This can be calculated using the approach, that I have proposed. Just expand the denominator to be of the form P(x) = 1 - a1x - a2x^2 - ..., where coefficients of powers of x encode the coefficients of the recurrence and powers define the dependent term of the recurrence, Q(x) obviously encodes the initial values of the recurrence, and hence it converts to this problem. -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/81e6a162-2763-4842-b807-862128e63714%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
