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 A279795 #43 Oct 01 2021 11:54:23
%S A279795 5,7,13,433,571
%N A279795 Numbers n such that F(n) and F(n-2) are both prime where F(n) = A000045(n).
%C A279795 a(6) > 2904353. - _Daniel Suteu_, Dec 23 2016
%C A279795 Terms n of A001605 such that n-2 is also a term of A001605. Surprisingly, the first 4 terms minus 2, { 3, 5, 11, 431 }, are the first four terms of A101315 which also relates to simultaneously prime { m+2, F(m) and F(m)+2 }, but where F is a different function, m -> (m-1)^2 + 1. - _M. F. Hasler_, Dec 24 2016
%C A279795 Larger primes of the Fibonacci prime pairs in A073340. - _Bobby Jacobs_, Jan 18 2017
%F A279795 a(n) = A281087(n) + 2. - _Bobby Jacobs_, Jan 18 2017
%e A279795 13 is a term because Fibonacci(13) = 233 and Fibonacci(11) = 89 are both prime.
%t A279795 Select[Range[10^4], Times @@ Boole@ Map[PrimeQ@ Fibonacci@ # &, {#, # - 2}] > 0 &] (* _Michael De Vlieger_, Jan 21 2017 *)
%t A279795 Flatten[Position[Partition[Fibonacci[Range[580]],3,1],_?(AllTrue[ {#[[1]],#[[3]]},PrimeQ]&),1,Heads->False]]+2 (* _Harvey P. Dale_, Oct 01 2021 *)
%o A279795 (PARI) isok(n) = isprime(fibonacci(n)) && isprime(fibonacci(n-2)); \\ _Michel Marcus_, Jan 14 2017
%Y A279795 Cf. A000045, A001605, A006512, A073340, A101315, A281087.
%K A279795 more,nonn
%O A279795 1,1
%A A279795 _Altug Alkan_, Dec 18 2016