Successive remainders when computing the Euclidean algorithm for (n,m) where m is any positive integer having no common factor with n, gives a list ending with a sublist of Fibonacci sequence. Find m such that this sublist has the greatest length and define a(n) as this length.

A087295

Successive remainders when computing the Euclidean algorithm for (n,m) where m is any positive integer having no common factor with n, gives a list ending with a sublist of Fibonacci sequence. Find m such that this sublist has the greatest length and define a(n) as this length.

Terms

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

External references