Numbers n such that Fibonacci(n) == prime(n) (mod n).

Terms

a(0) =1a(1) =2a(2) =3a(3) =4a(4) =68a(5) =76a(6) =116a(7) =181a(8) =357a(9) =789a(10) =1251a(11) =3861a(12) =40087a(13) =125902a(14) =201986a(15) =251737a(16) =846623a(17) =936418a(18) =1327269a(19) =2003626a(20) =3546266a(21) =4124468a(22) =4832054a(23) =4866214a(24) =5086202a(25) =5627521a(26) =92660777a(27) =331915497a(28) =339145743a(29) =394668171