See also
http://ask.sagemath.org/question/23610/symbolic-integer-arithmetic/#23613
with my take on a generalized Binet formula. That would take care of all
degree-2 recurrences with constant coeffs from QQ. I have something in the
brewing on top of trac #15714 which needs review. But this gets you only the
C-finite case, and D-finite is completely different, and I have no idea about
algorithms there.
On the other hand, guessing C-finite is done in #15714, and for D-finite Sage
has ore_algebra as optional package.
Regards,
On Thursday, September 25, 2014 8:26:30 PM UTC+2, projetmbc wrote:
> Hello.
>
>
> Is it possible to ask to sage to give formulas for simple recursive sequences
> ?
>
>
> For example, w_{n+1} = (n+1)/n*w_n + 1/n with w_0 = 1 , we have w_n = 2 n
> + 1 . More simple example could be arithmetico-geometrical sequences w_{n+1}
> = a*w_n + b .
>
>
> Christophe BAL
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@googlegroups.com.
To post to this group, send email to sage-support@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-support.
For more options, visit https://groups.google.com/d/optout.
