This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A214967 a(n) is the least m > 0 such that n-m divides Fibonacci(n)-m. 2
 1, 2, 3, 1, 4, 1, 7, 4, 1, 5, 1, 2, 3, 8, 15, 7, 16, 17, 1, 2, 3, 21, 12, 1, 25, 14, 27, 4, 1, 2, 1, 2, 3, 1, 18, 17, 35, 38, 27, 6, 1, 2, 3, 20, 45, 1, 24, 1, 15, 44, 3, 5, 8, 13, 49, 2, 55, 53, 1, 2, 1, 2, 3, 15, 64, 24, 67, 44, 47, 69, 1, 1, 3, 38, 75, 5, 76, 10, 1, 2, 3, 30 (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 8#33, 7#32, 6#31, 5|30 so a(9) = 4. MATHEMATICA Table[m = 1; While[! Divisible[Fibonacci[n]-m, n-m], m++]; m, {n, 2, 100}] CROSSREFS Cf. A214968. Sequence in context: A035426 A065516 A280699 * A195164 A223025 A087088 Adjacent sequences:  A214964 A214965 A214966 * A214968 A214969 A214970 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.

Last modified July 24 04:08 EDT 2019. Contains 325290 sequences. (Running on oeis4.)