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

1, 1, 3, 3, 2, 5, 7, 3, 6, 9, 4, 11, 10, 5, 15, 15, 6, 17, 12, 7, 18, 21, 8, 15, 22, 9, 20, 27, 10, 29, 31, 11, 30, 21, 12, 35, 34, 13, 24, 39, 14, 41, 36, 15, 42, 45, 16, 35, 30, 17, 44, 51, 18, 33, 40, 19, 54, 57, 20, 59, 58, 21, 63, 39, 22, 65, 60, 23, 42, 69, 24

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 47#55, 29#89, 18|144 so a(9) = 3.

Mathematica

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

Crossrefs

Cf. A214920.

Sequence in context: A279056 A265751 A143050 * A290599 A070163 A083343

Adjacent sequences: A214916 A214917 A214918 * A214920 A214921 A214922

Keyword

nonn,easy

Author

Clark Kimberling, Jul 30 2012

Status

approved