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 A053341 #24 Jun 25 2021 03:29:05
%S A053341 3,5,7,17,19,151,163,257,487,751,1459,1471,39367,65537,72031,279511,
%T A053341 33820711,86093443,258280327,372027811,4092305911,11149928791,
%U A053341 42638305711,209481995953231,411782264189299,3561193931204911
%N A053341 Euclid-Pocklington primes: primes of the form Product_{i=1..k} prime(i) * prime(k+1)^m + 1 where prime(r) is the r-th prime and Product_{i=1..k} prime(i) < prime(k+1)^m.
%C A053341 Named after the Greek mathematician Euclid (flourished c. 300 B.C.) and the English physicist and mathematician Henry Cabourn Pocklington (1870-1952). - _Amiram Eldar_, Jun 24 2021
%H A053341 Donovan Johnson, <a href="/A053341/b053341.txt">Table of n, a(n) for n = 1..454</a>
%e A053341 5 = 2^2+1 is of this form (with k=0).
%t A053341 eucpock[max_] := Module[{p = 1, prod = 1, m, q, r, s = {}}, While[prod < max, prod *= p; q = NextPrime[p]; m = Max[1, Ceiling @ Log[q, prod]]; r = prod * q^m; While[r + 1 <= max, If[PrimeQ[r + 1], AppendTo[s, r + 1]]; r *= q]; p = NextPrime[p]]; Union[s]]; eucpock[10^16] (* _Amiram Eldar_, Jun 24 2021 *)
%Y A053341 Cf. A006862.
%K A053341 nonn,easy,nice
%O A053341 1,1
%A A053341 _N. J. A. Sloane_, Jan 05 2000
%E A053341 More terms from _Jud McCranie_, Jul 11 2000