A071779 - OEIS

A071779

Smallest k > n such that F(n) + F(i) divides F(k) + F(i) 1<=i<=n and where F(n) are the Fibonacci numbers.

%I #8 Oct 02 2013 15:12:32

%S 2,4,21,64,235,846,1673,5048,191511,55450,776149

%N Smallest k > n such that F(n) + F(i) divides F(k) + F(i) 1<=i<=n and where F(n) are the Fibonacci numbers.

%C Next term, if it exists, is greater than 3000000. - _Ryan Propper_, Sep 16 2005

%o (PARI) for(n=1,8,s=n+1; while(sum(i=1,n,(fibonacci(s)+fibonacci(i))%(fibonacci(n)+fibonacci(i)))>0,s++); print1(s,","))

%K nonn

%O 1,1

%A _Benoit Cloitre_, Jun 04 2002

%E 3 more terms from _Ryan Propper_, Sep 16 2005