login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A214968
Least m>0 such that n-m divides L(n)-m, where L = A000032 (Lucas numbers).
2
1, 2, 1, 2, 2, 5, 5, 8, 9, 7, 2, 9, 13, 14, 9, 15, 2, 4, 19, 16, 21, 6, 22, 1, 25, 26, 7, 2, 18, 29, 17, 32, 33, 31, 2, 11, 33, 16, 33, 6, 18, 25, 43, 8, 45, 9, 2, 1, 49, 50, 7, 4, 18, 18, 47, 56, 3, 24, 58, 15, 61, 62, 47, 63, 10, 25, 67, 68, 69, 8, 22, 1, 67, 74, 39, 71
OFFSET
2,2
LINKS
EXAMPLE
Write x#y if x|y is false; then 7#46, 6#45, 5#44, 4#43, 3|42 so a(8) = 5.
MATHEMATICA
Table[m = 1; While[! Divisible[LucasL[n]-m, n-m], m++]; m, {n, 2, 100}]
CROSSREFS
Cf. A214967.
Sequence in context: A364536 A058701 A004559 * A340059 A095291 A285003
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Jul 31 2012
STATUS
approved