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 A277005 #37 Sep 27 2023 02:45:08
%S A277005 2,5,29,193,1733,17291,207367,2903041,43545611,696729629,12541132817,
%T A277005 250822656001,5267275776047,115880067072017,2781121609728037,
%U A277005 69528040243200079,1807729046323200001,48808684250726400031,1366643159020339200397
%N A277005 Least prime greater than n-th compositorial.
%F A277005 a(n) = A151800(A036691(n)). - _Michel Marcus_, Sep 25 2016
%e A277005 a(0) = A151800(A036691(0)) = A151800(1) = 2; where the zeroth compositorial, A036691(0), is the empty product = 1.
%e A277005 a(3) = 193, which is the least prime number greater than the third compositorial number, 192 = 4 * 6 * 8.
%t A277005 findComp[n_] := FixedPoint[n + PrimePi@ # + 1 &, n + PrimePi@ n + 1] ; Table[NextPrime@ Product[findComp@ k, {k, n}], {n, 0, 18}] (* _Michael De Vlieger_, Sep 25 2016, after _Robert G. Wilson v_ at A036691 *)
%Y A277005 Cf. A036691, A038710, A151800.
%K A277005 easy,nonn
%O A277005 0,1
%A A277005 _Walter Carlini_, Sep 25 2016
%E A277005 a(18) corrected by _Sean A. Irvine_, Sep 26 2023