OFFSET
1,2
LINKS
Giovanni Resta, Table of n, a(n) for n = 1..1000
MATHEMATICA
Select[Range[2000], Mod[Fibonacci[#+2], #] == 0 &] (* T. D. Noe, Feb 05 2014 *)
PROG
(Python)
prpr = prev = 1
for i in range(3, 3000):
prpr, prev = prev, prpr+prev
if prev % (i-2) == 0: print(i-2, end=', ')
(PARI) is(n)=((Mod([1, 1; 1, 0], n))^(n+2))[1, 2]==0 \\ Charles R Greathouse IV, Feb 03 2014
CROSSREFS
KEYWORD
nonn
AUTHOR
Alex Ratushnyak, May 03 2013
STATUS
approved