Least k such that F(k) reduced (mod prime(n)) = prime(n)-1 where F(k) is the k-th Fibonacci number.

A074806

Least k such that F(k) reduced (mod prime(n)) = prime(n)-1 where F(k) is the k-th Fibonacci number.

Terms

    a(0) =1a(1) =3a(2) =9a(3) =7a(4) =8a(5) =13a(6) =17a(7) =16a(8) =23a(9) =12a(10) =28a(11) =37a(12) =19a(13) =43a(14) =15a(15) =53a(16) =56a(17) =29a(18) =67a(19) =68a(20) =73a(21) =76a(22) =83a(23) =21a(24) =97a(25) =48a(26) =103a(27) =35a(28) =53a(29) =37

External references