Primes p with a Fibonacci primitive root g, i.e., such that g^2 = g + 1 (mod p).

Terms

a(0) =5a(1) =11a(2) =19a(3) =31a(4) =41a(5) =59a(6) =61a(7) =71a(8) =79a(9) =109a(10) =131a(11) =149a(12) =179a(13) =191a(14) =239a(15) =241a(16) =251a(17) =269a(18) =271a(19) =311a(20) =359a(21) =379a(22) =389a(23) =409a(24) =419a(25) =431a(26) =439a(27) =449a(28) =479a(29) =491