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.

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

Offset

1,1

Comments

Next term, if it exists, is greater than 3000000. - Ryan Propper, Sep 16 2005

Links

Table of n, a(n) for n=1..11.

Prog

(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, ", "))

Crossrefs

Sequence in context: A122736 A296276 A092458 * A107388 A233289 A296282

Adjacent sequences: A071776 A071777 A071778 * A071780 A071781 A071782

Keyword

nonn

Author

Benoit Cloitre, Jun 04 2002

Extensions

3 more terms from Ryan Propper, Sep 16 2005

Status

approved