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 A084730 #16 Nov 23 2023 11:30:28
%S A084730 2,3,5,23,239,719,5039,201599,1088639,14515199,159667199,479001599,
%T A084730 31135103999,87178291199,2615348735999,188305108991999,
%U A084730 711374856191999,192071211171839999,3649353012264959999,12164510040883199999,2248001455555215359999,2248001455555215359999
%N A084730 Smallest prime of the form k*n! - 1.
%H A084730 Robert Israel, <a href="/A084730/b084730.txt">Table of n, a(n) for n = 2..447</a>
%F A084730 a(n) = A083663(n)*n! - 1 = A038700(n!). - _Robert Israel_, Nov 23 2023
%e A084730 a(8) = 161599 = 4*8! - 1 is a prime.
%p A084730 f:= proc(n) local w,k;
%p A084730 w:= n!;
%p A084730 for k from 1 do
%p A084730 if isprime(k*w-1) then return k*w-1 fi
%p A084730 od
%p A084730 end proc:
%p A084730 map(f, [$1..30]); # _Robert Israel_, Nov 23 2023
%t A084730 Do[k = 1; While[ !PrimeQ[k*n! - 1], k++ ]; Print[k*n! - 1], {n, 2, 20}]
%o A084730 (PARI) a(n)=if(n<1,0,k=1; while(isprime(k*n!-1)==0,k++); k*n!-1)
%Y A084730 Cf. A083663, A038700.
%K A084730 nonn
%O A084730 2,1
%A A084730 _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jun 13 2003
%E A084730 Corrected and extended by _Benoit Cloitre_, Jun 14 2003