VOOZH
about
URL: https://oeis.org/A071779
⇱ A071779 - OEIS
login
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
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:
A296276
A092458
A393133
*
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