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 A118370 #13 Jan 03 2021 22:55:50
%S A118370 2,3,37,101,197,331777,677,8503057,9834497,5477,59969537,8837,17957,
%T A118370 21317,562448657,916636177,42437,3208542737,3782742017,5006411537,
%U A118370 7676563457,98597,106277,11574317057,19565295377,416806419029812551937,148997,34188010001,38167092497
%N A118370 Divisorial primes: Primes p such that p = 1 + Product_{d|n} d for some n (ordered by n).
%C A118370 See A118369 for the corresponding n. These are primes in the sequence 1 + A007955. (The suggested name "divisorial prime" is obviously analogous to that of factorial primes (A088332) and primorial primes (A014545).).
%H A118370 Amiram Eldar, <a href="/A118370/b118370.txt">Table of n, a(n) for n = 1..10000</a>
%e A118370 The prime 37 is a(3) as there exists a number, A118369(3)=6, such that 37 = 6*3*2*1 + 1, where {1,2,3,6} are all the positive divisors of 6.
%t A118370 Reap[For[n = 1, n <= 500, n++, p = Times @@ Divisors[n]; If[PrimeQ[p+1], Sow[p+1]]]][[2, 1]] (* _Jean-François Alcover_, Oct 07 2016 *)
%o A118370 (PARI) for(n=1,2500, s=1; fordiv(n,d,s=s*d); if(isprime(s+1), print1(s+1,", ")))
%Y A118370 Cf. A118369, A007955.
%Y A118370 Cf. A014545, A088332.
%Y A118370 Cf. A258455 (sorted).
%K A118370 nonn
%O A118370 1,1
%A A118370 _Rick L. Shepherd_, Apr 25 2006