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.

0, 0, 1, 2, 1, 3, 1, 2, 4, 2, 1, 3, 2, 5, 3, 2, 2, 3, 4, 3, 3, 6, 2, 4, 2, 3, 3, 3, 4, 5, 3, 4, 3, 4, 7, 3, 3, 5, 4, 3, 2, 4, 2, 4, 4, 5, 3, 6, 4, 4, 5, 4, 3, 5, 3, 8, 3, 4, 4, 4, 6, 5, 3, 4, 4, 3, 5, 4, 4, 5, 4, 5, 3, 6, 4, 4, 7, 5, 4, 5, 4, 6, 5, 4, 3, 5, 6, 4, 4, 9, 3, 4, 5, 5, 4, 5, 4, 7, 5, 6, 4, 5, 3, 5, 4

Offset

0,4

Links

Table of n, a(n) for n=0..104.

Example

a(5) = 3 because computing Euclidean algorithm for (5,8) gives 3, 2, 1 as successive remainders, all three belonging to Fibonacci sequence.

Crossrefs

Sequence in context: A334217 A334431 A342011 * A175344 A056951 A130517

Adjacent sequences: A087292 A087293 A087294 * A087296 A087297 A087298

Keyword

easy,nonn

Author

Thomas Baruchel, Oct 19 2003

Status

approved