Consider Fibonacci-type sequences f(0)=X, f(1)=Y, f(k)=f(k-1)+f(k-2) mod n; all are periodic; sequence gives number of distinct periods.

A015135

Consider Fibonacci-type sequences f(0)=X, f(1)=Y, f(k)=f(k-1)+f(k-2) mod n; all are periodic; sequence gives number of distinct periods.

Terms

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

External references