Consider Fibonacci-type sequences b(0)=X, b(1)=Y, b(k)=b(k-1)+b(k-2) mod n; all are periodic; sequence gives number of maximal length periods.
A015138
Consider Fibonacci-type sequences b(0)=X, b(1)=Y, b(k)=b(k-1)+b(k-2) mod n; all are periodic; sequence gives number of maximal length periods.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =1a(6) =3a(7) =4a(8) =3a(9) =1a(10) =11a(11) =5a(12) =6a(13) =3a(14) =4a(15) =8a(16) =8a(17) =13a(18) =19a(19) =5a(20) =27a(21) =11a(22) =11a(23) =21a(24) =5a(25) =6a(26) =9a(27) =15a(28) =58a(29) =4
External references
- oeis: A015138