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 A137322 #16 Mar 12 2022 07:55:42
%S A137322 2,93,1915,2805257,1022362697389,52812321503747,296760465891270915823,
%T A137322 13532790387670672394876021,244372391812343146601953447089433,
%U A137322 11196066938065133911754151366849886273516531,3328707950474207400029638710843582600755265569
%N A137322 a(n) = k! - A051674(n), where k is the smallest number for which A051674(n) <= k! where A051674(n) = prime(n)^prime(n).
%e A137322 a(4) = 10! - prime(4)^prime(4) = 3628800 - 823543 = 2805257.
%t A137322 a[n_] := Module[{p = Prime[n]^Prime[n], k = 1}, While[k! < p, k++]; k! - p]; Array[a, 11] (* _Amiram Eldar_, Mar 12 2022 *)
%o A137322 (PARI) f(n) = my(p = prime(n)); p^p;
%o A137322 a(n) = my(k=1, P=f(n)); until(k! >= P, k++); k!-P; \\ _Michel Marcus_, Mar 12 2022
%Y A137322 Cf. A000040, A000142, A051674, A136437.
%K A137322 easy,nonn
%O A137322 1,1
%A A137322 _Ctibor O. Zizka_, Apr 06 2008
%E A137322 Corrected and extended by _Michel Marcus_, Mar 12 2022