|
|
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.
|
|
0
|
|
|
2, 4, 21, 64, 235, 846, 1673, 5048, 191511, 55450, 776149
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Next term, if it exists, is greater than 3000000. - Ryan Propper, Sep 16 2005
|
|
LINKS
|
|
|
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
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|