A214918 - OEIS

A214918

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

1, 1, 2, 1, 4, 3, 2, 4, 8, 3, 10, 6, 4, 7, 14, 5, 16, 9, 6, 10, 20, 7, 14, 12, 8, 13, 26, 9, 28, 15, 10, 16, 20, 11, 34, 18, 12, 19, 38, 13, 40, 21, 14, 22, 44, 15, 34, 24, 16, 25, 50, 17, 32, 27, 18, 28, 56, 19, 58, 30, 20, 31, 38, 21, 64, 33, 22, 34, 68, 23, 70, 36

(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 55#377, 34#610, 21|987 so a(11) = 3.

MATHEMATICA

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

CROSSREFS

Cf. A214917.

Sequence in context: A065620 A104895 A103122 * A328394 A087850 A087849

Adjacent sequences: A214915 A214916 A214917 * A214919 A214920 A214921

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Jul 30 2012

STATUS

approved