A214917 - OEIS

A214917

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

1, 1, 1, 3, 4, 2, 6, 7, 3, 9, 7, 4, 12, 13, 5, 10, 16, 6, 18, 19, 7, 21, 17, 8, 24, 16, 9, 27, 28, 10, 19, 31, 11, 33, 34, 12, 27, 37, 13, 39, 25, 14, 42, 32, 15, 28, 46, 16, 48, 49, 17, 51, 52, 18, 54, 34, 19, 42, 49, 20, 37, 61, 21, 63, 47, 22, 66, 67, 23, 58, 43, 24

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

OFFSET

2,4

LINKS

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

EXAMPLE

Write x#y if x|y is false; then 34#144, 21#233, 13|377 so a(10) = 3.

MATHEMATICA

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

CROSSREFS

Cf. A214738, A075861.

Sequence in context: A207376 A213197 A049277 * A260316 A258742 A372862

Adjacent sequences: A214914 A214915 A214916 * A214918 A214919 A214920

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Jul 30 2012

STATUS

approved