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 minimal nontrivial period.
A015136
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 minimal nontrivial period.
Terms
- a(0) =1a(1) =3a(2) =8a(3) =3a(4) =4a(5) =3a(6) =16a(7) =3a(8) =8a(9) =3a(10) =5a(11) =3a(12) =28a(13) =3a(14) =4a(15) =3a(16) =36a(17) =3a(18) =9a(19) =3a(20) =8a(21) =3a(22) =48a(23) =3a(24) =4a(25) =3a(26) =8a(27) =3a(28) =7a(29) =3
External references
- oeis: A015136