How can I write an algorithm in maple that gives me a lisft of the Fibonacci polynomies between two numbers using the recursion: F1(x) = 1 F2(x) = x Fn+1(x) = x*Fn(x) + Fn−1(x) if anyone knows please help me!! And the same question(gettin a list between two numbers) using the sum: sum(binomial(n-j-1,j)*x^(n-2j-1))),j=0..floor((n-1)/2) Please help... Thanks =D Jacob

How can I write a recursive algorithm on maple wich gives me the fibonacci polinomies knowing that: F1(x) = 1 F2(x) = x Fn+1(x) = xFn(x) + Fn−1(x), n = 2, 3, ... help me please!!!

How can I write a recursive algorithm on maple wich gives me the fibonacci polinomies knowing that: F1(x) = 1 F2(x) = x Fn+1(x) = xFn(x) + Fn−1(x), n = 2, 3, ... help me please!!!