OFFSET
1,1
COMMENTS
This polynomial is the characteristic polynomial of the Fibonacci and Lucas k-step recursions. Are the k-step recursions different -- in some way -- for the values of k that yield a prime discriminant? No other k < 10000.
LINKS
Eric Weisstein's World of Mathematics, Fibonacci n-Step Number.
CROSSREFS
KEYWORD
hard,more,nonn
AUTHOR
T. D. Noe, May 02 2005
STATUS
approved