Re: [math-fun] Fibonacci mod n question

=Dan Asimov ...QUESTION: What is a formula for fp(n) in general?

Interesting question, but isn't this basically asking for a formula for the multiplicative order of the matrix [1 1] [0 1] mod n? I understand that's hard for just integers; should we expect it to be easier in matrix land? (but fp(n) sounds like a great candidate for the OEIS!)