login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

LINKS

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

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: A145862 A058701 A004559 * A095291 A285003 A284002

Adjacent sequences:  A214965 A214966 A214967 * A214969 A214970 A214971

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Jul 31 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 July 13 17:54 EDT 2020. Contains 335689 sequences. (Running on oeis4.)