OFFSET
1,2
COMMENTS
Equivalently, k divides Fibonacci(k) + 8.
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..10000
MAPLE
with(combinat, fibonacci):
select(n->(fibonacci(n) + 8) mod n = 0, [$1..10^4 ]); # Muniru A Asiru, Jan 28 2018
MATHEMATICA
Select[Range[5000], Divisible[Fibonacci[#]+8, #]&] (* Harvey P. Dale, Mar 26 2011 *)
PROG
(PARI) isok(n) = ((fibonacci(n)+8) % n) == 0; \\ Michel Marcus, Jan 27 2018
(Magma) [n: n in [1..5*10^3] | (Fibonacci(n)+8) mod n eq 0 ]; // Vincenzo Librandi, Jan 27 2018
(GAP) Filtered([1..10^4], n -> (Fibonacci(n) + 8) mod n = 0); # Muniru A Asiru, Jan 28 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved