login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214919 a(n) is the least m > 0 such that Lucas(n-m) divides Fibonacci(n+m). 2
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 (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 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 08:36 EDT 2019. Contains 328107 sequences. (Running on oeis4.)