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

1, 1, 2, 1, 3, 3, 6, 5, 8, 7, 9, 9, 12, 11, 14, 13, 15, 15, 18, 17, 20, 19, 21, 21, 24, 23, 26, 25, 27, 27, 30, 29, 32, 31, 33, 33, 36, 35, 38, 37, 39, 39, 42, 41, 44, 43, 45, 45, 48, 47, 50, 49, 51, 51, 54, 53, 56, 55, 57, 57, 60, 59, 62, 61, 63, 63, 66, 65, 68, 67

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 21#123, 13#199, 8#322, 5#521, 3|843 so a(9) = 5.

Mathematica

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

Crossrefs

Cf. A214919.

Sequence in context: A343381 A336096 A227774 * A096373 A216961 A241379

Adjacent sequences: A214917 A214918 A214919 * A214921 A214922 A214923

Keyword

nonn,easy

Author

Clark Kimberling, Jul 30 2012

Status

approved