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 A088415 #8 Jul 08 2023 14:32:39
%S A088415 2,3,5,7,11,13,17,19,43,53,59,73,79,83,89,149,367,431,853,4007,6143,
%T A088415 8819,8969
%N A088415 Primes p = prime(i) such that p(i)# - p(i+1) or p(i)# + p(i+1) or both are primes.
%H A088415 Dario Alejandro Alpern, <a href="https://www.alpertron.com.ar/ECM.HTM">Factorization using the Elliptic Curve Method</a>.
%H A088415 Hisanori Mishima, <a href="https://www.asahi-net.or.jp/~KC2H-MSM/mathland/matha1/matha106.htm">PI Pn + NextPrime (n = 1 to 100)</a>.
%H A088415 Hisanori Mishima, <a href="https://www.asahi-net.or.jp/~KC2H-MSM/mathland/matha1/matha107.htm">PI Pn - NextPrime (n = 1 to 100)</a>.
%e A088415 3=p(2) is in the sequence because p(2)# + p(3) = 11 is prime.
%t A088415 Do[ p = Product[Prime[i], {i, 1, n}]; q = Prime[n + 1]; If[ PrimeQ[p - q] || PrimeQ[p + q], Print[ Prime[n]]], {n, 1, 1435}]
%Y A088415 Cf. A087714.
%K A088415 hard,more,nonn
%O A088415 1,1
%A A088415 _Ray Chandler_, Oct 05 2003
%E A088415 Edited by _Robert G. Wilson v_, Oct 17 2003