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 distinct periods.

A015134

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 distinct periods.

Terms

    a(0) =1a(1) =2a(2) =2a(3) =4a(4) =3a(5) =4a(6) =4a(7) =8a(8) =5a(9) =6a(10) =14a(11) =10a(12) =7a(13) =8a(14) =12a(15) =16a(16) =9a(17) =16a(18) =22a(19) =16a(20) =29a(21) =28a(22) =12a(23) =30a(24) =13a(25) =14a(26) =14a(27) =22a(28) =63a(29) =24

External references