Voozh

A214962

a(n) is the least m > 0 such that Fibonacci(n-m) divides Fibonacci(2n+2m).

1, 1, 2, 1, 2, 3, 4, 3, 2, 7, 4, 9, 6, 3, 8, 13, 6, 15, 4, 7, 11, 19, 8, 5, 13, 9, 12, 25, 6, 27, 16, 11, 17, 7, 12, 33, 19, 13, 8, 37, 14, 39, 22, 9, 23, 43, 16, 21, 10, 17, 26, 49, 18, 11, 24, 19, 29, 55, 12, 57, 31, 21, 32, 13, 22, 63, 34, 23, 14, 67, 24, 69, 37, 15

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,3

LINKS

Clark Kimberling, Table of n, a(n) for n = 2..1000

EXAMPLE

Write x#y if x|y is false; then 8#987, 5#2584, 3|6765 so a(7) = 3.

MATHEMATICA

Table[m = 1; While[! Divisible[Fibonacci[2n+2m], Fibonacci[n - m]], m++]; m, {n, 2, 100}]

CROSSREFS

Cf. A214917.

Sequence in context: A213088 A357564 A169809 * A350809 A366525 A360737