This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A064739 #28 Sep 24 2022 14:01:47
%S A064739 2,11,19,29,31,41,59,61,71,79,89,101,109,131,139,149,151,179,181,191,
%T A064739 199,211,229,239,241,251,269,271,281,311,331,349,359,379,389,401,409,
%U A064739 419,421,431,439,449,461,479,491,499,509,521,541,569,571,599,601,619
%N A064739 Primes p such that Fibonacci(p)-1 is divisible by p.
%H A064739 Harry J. Smith, <a href="/A064739/b064739.txt">Table of n, a(n) for n = 1..1000</a>
%F A064739 Presumably this consists of 2 together with the primes congruent to +-1 mod 5.
%t A064739 lst={};Do[p=Prime[n];If[Mod[(Fibonacci[p]-1),p]==0,AppendTo[lst,p]],{n,6!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Apr 03 2009 *)
%t A064739 Select[Prime[Range[150]],Divisible[Fibonacci[#]-1,#]&] (* _Harvey P. Dale_, Sep 24 2022 *)
%o A064739 (PARI) forprime(p=2,700, if((fibonacci(p)-1)%p==0,print1(p,", ")))
%o A064739 (PARI) { n=0; for (m=1, 10^9, p=prime(m); if ((fibonacci(p) - 1)%p==0, write("b064739.txt", n++, " ", p); if (n==1000, break)) ) } \\ _Harry J. Smith_, Sep 24 2009
%Y A064739 {2} union A045468. Complement is A003631 minus {2}.
%K A064739 nonn
%O A064739 1,1
%A A064739 _Shane Findley_ and _N. J. A. Sloane_, Oct 17 2001
%E A064739 More terms from _Klaus Brockhaus_, Oct 18 2001