how to solve recurances?



<skipped>
> Hello! This problem is solved by the recur package:
>
> (C54) load(recur);
>
> (C55) char(t(n+1)-2*t(n),1,t,n,1,[t(0)=0]);
>
>                                          n
> (D55)                            t(n) = 2  - 1
>
> Thanks to Dan Stanger :)
That's cool! The problem here is that it is not documented well, though you 
can always get the resque advice from the macsyma's experts.  Still a lot of 
work to make the documentation better. Please don't consider this as critique 
of the maxima's maintainers and developers. They do the best.

rgds,
v