OFFSET
1,1
COMMENTS
Consider the 2-step recursion x(k)=x(k-1)+x(k-2) mod n. For any of the n^2 initial conditions x(1) and x(2) in Zn, the recursion has a finite period. When n is a prime in this sequence, all of the orbits, except the one containing (0,0), have the same length.
LINKS
Eric Weisstein's World of Mathematics, Fibonacci n-Step Number.
CROSSREFS
KEYWORD
nonn
AUTHOR
T. D. Noe, May 02 2005
STATUS
approved