login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214738 a(n) is the least m > 0 such that n-m divides Fibonacci(n)+m. 2
1, 2, 3, 3, 4, 2, 7, 8, 5, 1, 6, 7, 13, 10, 15, 11, 16, 4, 15, 10, 19, 3, 12, 6, 17, 22, 27, 27, 20, 6, 21, 32, 27, 10, 3, 16, 37, 14, 35, 23, 11, 3, 43, 40, 37, 7, 24, 47, 25, 26, 21, 31, 52, 5, 37, 28, 57, 9, 30, 19, 61, 26, 63, 35, 64, 2, 67, 68, 55, 1, 36, 71, 41, 50 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,2
LINKS
EXAMPLE
Write x#y if x|y is false; then 9#56, 8#57, 7#58, 6#59, 5|60, so a(10) = 5.
MATHEMATICA
Table[m = 1; While[! Divisible[Fibonacci[n]+m, n - m], m++]; m, {n, 2, 100}]
CROSSREFS
Cf. A075861.
Sequence in context: A307838 A159909 A176004 * A353360 A098007 A278116
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Jul 28 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 06:57 EDT 2024. Contains 371265 sequences. (Running on oeis4.)