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