Least prime p == -1 (mod n) that divides Fibonacci((p+1)/n), or 0 if no such prime exists.

Terms

a(0) =2a(1) =13a(2) =47a(3) =0a(4) =0a(5) =113a(6) =307a(7) =0a(8) =233a(9) =0a(10) =967a(11) =0a(12) =2417a(13) =797a(14) =0a(15) =0a(16) =1087a(17) =233a(18) =5737a(19) =0a(20) =5417a(21) =5653a(22) =1103a(23) =0a(24) =0a(25) =2417a(26) =4373a(27) =0a(28) =6263a(29) =0