Yes, it's the rsolve command.

i.e., to generate the closed-form for the nth Fibonacci number type:

rsolve({f(n)=f(n-1)+f(n-2),f(0)=1,f(1)=1},{f(n)});

This will give you:

Which is the formula we get from Binet's formula.

By tweaking it accordingly, you should get the polynomials:

The closed-form is