REDUCE

7.4 Fibonacci Numbers and Fibonacci Polynomials

The unary operator Fibonacci provides notation and computation for Fibonacci numbers. Fibonacci(n) evaluates to the nth Fibonacci number. If n is a positive or negative integer, it will be evaluated following the definition:

F0 = 0;F1 = 1;Fn = Fn-1 + Fn-2

Fibonacci Polynomials are computed by the binary operator FibonacciP. FibonacciP(n,x) returns the nth Fibonaccip polynomial in the variable x. If n is a positive or negative integer, it will be evaluated following the definition:

F0(x) = 0;F1(x) = 1;Fn(x) = xFn-1(x) + Fn-2(x)