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 A087898 #13 Jan 19 2023 03:12:26
%S A087898 2,3,5,13,23,37,53,67,79,157,173,191,197,277,281,461,479,503,619,829,
%T A087898 907,997,1033,1303,1459,1493,1663,2357,2467,3331,3347,3407,4093,4441,
%U A087898 4591,4987,5179,5189,6911,8807,9227,9739,10243,10559,11093,11549,11617
%N A087898 Choose a(n) so that 2*3*5*13*...*a(n) - 1 is prime; a(n) is prime; and a(n) > a(n-1).
%C A087898 Recursive prime generating sequence.
%D A087898 Harvey Dubner, Recursive Prime Generating Sequences, Journal of Recreational Mathematics, Vol. 29, No. 3 (1998), pp. 170-175, see p. 173, Table 3.
%H A087898 Amiram Eldar, <a href="/A087898/b087898.txt">Table of n, a(n) for n = 1..500</a>
%t A087898 a[1] = 2; a[n_] := a[n] = Module[{r = Product[a[k], {k, 1, n - 1}], p = NextPrime[a[n - 1]]}, While[! PrimeQ[r*p - 1], p = NextPrime[p]]; p]; Array[a, 50] (* _Amiram Eldar_, Jan 19 2023 *)
%Y A087898 For the primes so generated see A087899.
%Y A087898 Cf. A039726.
%K A087898 nonn
%O A087898 1,1
%A A087898 _Lekraj Beedassy_, Oct 14 2003
%E A087898 More terms from _Ray Chandler_, Nov 06 2003