A204929 (s(k(n)) - s(j(n)))/n, where (s(k(n)), s(j(n))) is the least pair of distinct Fibonacci numbers for which n divides s(k(n)) - s(j(n)).

1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 15, 1, 2, 1, 1, 1, 1, 4, 10, 6, 2, 1, 2, 3, 1, 85, 1, 1, 1, 1, 506, 4, 15, 2, 107, 61, 3, 1, 2, 2, 5, 5, 1, 3, 7, 1, 50, 1, 1, 1, 1, 46, 4, 4, 2056, 451

Offset: 1

Author

Clark Kimberling, Jan 21 2012

Keywords

• nonn

Comments

For a guide to related sequences, see A204892.

Links

• G. C. Greubel, Table of n, a(n) for n = 1..1000

Crossrefs

Cf. A204924, A204892, A204928.

Programs

Mathematica

(See the program at A204924.)