a(n) is the smallest prime == 1 (mod F(n)) where F(n) is the n-th Fibonacci number.

Terms

a(0) =2a(1) =2a(2) =3a(3) =7a(4) =11a(5) =17a(6) =53a(7) =43a(8) =103a(9) =331a(10) =179a(11) =433a(12) =467a(13) =5279a(14) =1831a(15) =5923a(16) =6389a(17) =7753a(18) =8363a(19) =27061a(20) =21893a(21) =35423a(22) =1146281a(23) =92737a(24) =3001001a(25) =1213931a(26) =392837a(27) =1906867a(28) =4113833a(29) =4992241