Numbers k such that F(k) == -1 (mod k), where F(n) = A000045(n) is the n-th Fibonacci number.

Terms

a(0) =1a(1) =2a(2) =3a(3) =4a(4) =7a(5) =13a(6) =14a(7) =17a(8) =23a(9) =26a(10) =34a(11) =37a(12) =43a(13) =46a(14) =47a(15) =53a(16) =67a(17) =73a(18) =74a(19) =83a(20) =86a(21) =94a(22) =97a(23) =103a(24) =106a(25) =107a(26) =113a(27) =127a(28) =134a(29) =137