Least prime p = 1 (mod n) which divides Fibonacci((p-1)/n).
A168171
Least prime p = 1 (mod n) which divides Fibonacci((p-1)/n).
Terms
- a(0) =11a(1) =29a(2) =139a(3) =61a(4) =211a(5) =541a(6) =2269a(7) =89a(8) =199a(9) =281a(10) =859a(11) =661a(12) =911a(13) =2269a(14) =2221a(15) =2081a(16) =2789a(17) =2161a(18) =3041a(19) =421a(20) =2521a(21) =19009a(22) =21529a(23) =3001a(24) =9901a(25) =5981a(26) =2161a(27) =2269a(28) =26449a(29) =2221
External references
- oeis: A168171