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 A270821 #35 May 03 2018 10:26:01
%S A270821 6,8,16,26,28,76,148,159,808,848,916,1143,4036,4959,43239,73432,98716,
%T A270821 144039,146132
%N A270821 Numbers n such that F(n) - n is a prime, where F(n) denotes the n-th Fibonacci number.
%e A270821 fibonacci(6) - 6 = 8 - 6 = 2 that is a prime;
%e A270821 fibonacci(8) - 8 = 21 - 8 = 13 that is a prime.
%p A270821 with(combinat): P:=proc(q) local n;
%p A270821 for n from 0 to q do
%p A270821 if isprime(fibonacci(n)-n) then print(n); fi; od; end: P(10^5);
%t A270821 Select[Range[150000],PrimeQ[Fibonacci[#]-#]&] (* _Harvey P. Dale_, May 03 2018 *)
%o A270821 (PARI) lista(nn) = {for(n=1, nn, if(ispseudoprime(fibonacci(n)-n), print1(n, ", ")));} \\ _Altug Alkan_, Mar 30 2016
%Y A270821 Cf. A000045, A065220, A064269, A069109, A175404.
%K A270821 nonn,more
%O A270821 1,1
%A A270821 _Paolo P. Lava_, Mar 30 2016
%E A270821 a(15)-a(19) from _Giovanni Resta_, Apr 14 2016