0
votes
0answers
33 views

Can Maple solve recurrence relations when n is only certain numbers?

If you have an equation $a(n)=a_{n-1}+2a_{n-2}$ only defined when n is powers of 2, how would convey that to Maple that n has a restriction? What if you wanted only $n \ge 2$?
1
vote
1answer
88 views

Generating Function via Recurrence Relation

I am trying to find the solution to the following recurrence for polynomials: \begin{align*} h^{[0]}(z) &= z \\ h^{[n+1]}(z) &= z h^{[n]}(z) (z+z^2+...+z^{n+1}) +z \end{align*} I calculated ...
1
vote
2answers
191 views

Simplify a recursively defined function in Maple

I have the following problem. Out of the runtime analysis of an divide and conquer algorithm I got the following formula for the necessary flops: ...
1
vote
0answers
140 views

recurrence relation of general difference polynomials

I have a sequence of difference polynomials (which I obtained by the method of finite differences) and I would like to find out if there is a recurrence relation between them. The generating function ...
0
votes
1answer
150 views

recurrence relation only for odd indices maple

I want to define a recurrence relation $a(n)$ which is only defined for odd n. I tried something like: a:= (2*n-1)->a(2n-3)+(2n-2)!+a(2n-5); which apparently doesn't work. How do I define this ...