OFFSET
1,1
COMMENTS
A subsequence of A217738.
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..1000
MATHEMATICA
fQ[n_] := Mod[ Fibonacci@ n, {n, n +1, n +2}] == {0, 0, 0}; Select[60 Range@513, fQ] (* Robert G. Wilson v, Jan 26 2018 *)
PROG
(Python)
from __future__ import division
A298684_list, n, a, b = [], 1, 1, 1
while len(A298684_list) < 1000:
if not (a % (n*(n+1)*(n+2)//(1 if n % 2 else 2))):
A298684_list.append(n)
n += 1
a, b = b, a+b # Chai Wah Wu, Jan 26 2018
(Magma) [n: n in [2..10^5] | IsZero(Fibonacci(n) mod (n)) and IsZero(Fibonacci(n) mod (n+1)) and IsZero(Fibonacci(n) mod (n+2))]; // Vincenzo Librandi, Jan 27 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Alex Ratushnyak, Jan 24 2018
STATUS
approved