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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A248032 Least positive number k such that n + k divides F(n) + F(k), where F(n) denotes the n-th Fibonacci number. 3
 1, 22, 9, 8, 1, 18, 10, 4, 3, 5, 35, 12, 17, 10, 3, 8, 13, 6, 31, 4, 9, 2, 47, 12, 5, 8, 9, 20, 1, 18, 19, 16, 3, 5, 10, 12, 13, 10, 38, 8, 109, 6, 7, 4, 9, 2, 14, 12, 1, 22, 39, 8, 97, 18, 58, 4, 32, 14, 191, 12, 89, 1, 27, 8, 85, 6, 70, 4, 39, 2, 11, 24, 77, 22, 15, 13, 73, 18, 10 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS I believe a(n) exists for all n > 0. LINKS Chai Wah Wu, Table of n, a(n) for n = 1..10000 PROG (PARI) a(n)=m=1; while((fibonacci(n)+fibonacci(m))%(m+n), m++); m vector(100, n, a(n)) CROSSREFS Cf. A000045, A247937. Sequence in context: A113783 A298781 A058402 * A068611 A104061 A196103 Adjacent sequences:  A248029 A248030 A248031 * A248033 A248034 A248035 KEYWORD nonn AUTHOR Derek Orr, Sep 29 2014 EXTENSIONS Definition clarified by Chai Wah Wu, Jan 02 2018 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 September 26 16:15 EDT 2021. Contains 347670 sequences. (Running on oeis4.)