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 A087200 #14 Jun 23 2017 03:26:49
%S A087200 5,7,11,17,29,29,41,37,47,89,83,101,107,67,109,73,89,167,139,229,163,
%T A087200 193,269,157,173,523,233,157,251,193,179,383,647,311,223,317,509,457,
%U A087200 211,503,251,479,617,1019,347,863,827,349,389,563,601,419,367,349,449
%N A087200 a(n) is the smallest m such that m > A005235(n) and A002110(n)+m is prime.
%C A087200 a(n) is the second m (first m is A005235(n)) such that m > 1 and A002110(n)+m is prime. I guess every term of this sequence (compare the conjecture about A005235) is prime. I checked this conjecture for n < 373.
%D A087200 R. K. Guy, Unsolved Problems in Number Theory, Section A2.
%H A087200 Vincenzo Librandi, <a href="/A087200/b087200.txt">Table of n, a(n) for n = 1..200</a>
%t A087200 A005235[n_] := (For[m=2, !PrimeQ[Product[Prime[k], {k, n}]+m], m++ ]; m); a[n_] := (For[m=A005235[n]+1, !PrimeQ[Product[Prime[k], {k, n}]+m], m++ ]; m); Table[a[n], {n, 60}]
%Y A087200 Cf. A005235, A002110.
%K A087200 easy,nonn
%O A087200 1,1
%A A087200 _Farideh Firoozbakht_, Aug 26 2003