Talk:Padovan polynomials

From Wikipedia, the free encyclopedia

At the moment the general recurrence given in this article is:

Pn(x) = xPn − 2(x) + Pn − 3(x)

which gives two Padovan polynomials with degree 2, two with degree 3 etc. Why is the recurrence not

Pn(x) = x2Pn − 2(x) + xPn − 3(x)

so that Pn(x) always has degree n-1, and there is a only one Padovan polynomial with a given degree ? This would be a closer analogue to Fibonacci polynomials. Gandalf61 11:21, August 26, 2005 (UTC)

Retrieved from "http://en.wikipedia.org../../../p/a/d/Talk%7EPadovan_polynomials_1d65.html"