1. A fast algorithm for computing large Fibonacci numbers;Takahashi;Inf. Process. Lett.,2000
2. Generating trees and the forbidden subsequences;West;Discrete Math.,1996
3. Fibonacci Series Modulo m;Wall;Amer. Math. Mon.,1960
4. The relations of the period modulo m to the rank of apparition of m in the Fibonacci sequence;Vinson;Fibonacci Quart.,1963
5. Fibonacci sequences of period n in groups;Wilcox;The Fibonacci Quart.,1986