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 A275272 #13 Mar 05 2022 14:17:24
%S A275272 2,3,5,7,11,13,19,31,23,19,17,43,73,41,149,41,53,61,109,37,37,71,109,
%T A275272 193,97,173,47,101,229,163,241,83,139,103,83,577,311,47,269,61,61,107,
%U A275272 97,89,379,149,269,83,137,167,281,89,79,443,229,157,179,563,389
%N A275272 a(n) = p - n!, where p is the second smallest prime > n!.
%C A275272 p-n! where p = nextprime(nextprime(n!)).
%C A275272 Is every term a prime?
%H A275272 Clark Kimberling, <a href="/A275272/b275272.txt">Table of n, a(n) for n = 1..300</a>
%F A275272 a(n) = A187874(n) - A000142(n). - _Michel Marcus_, Mar 05 2022
%e A275272 For n = 4, we have n! = 24, so that p = 31 and a(4) = 7.
%t A275272 Table[NextPrime[n!, 2] - n!, {n, 1, 150}]
%o A275272 (PARI) a(n) = nextprime(nextprime(n!+1)+1) - n!; \\ _Michel Marcus_, Mar 05 2022
%o A275272 (Python)
%o A275272 from sympy import factorial, nextprime
%o A275272 def a(n): fn = factorial(n); return nextprime(nextprime(fn)) - fn
%o A275272 print([a(n) for n in range(1, 60)]) # _Michael S. Branicky_, Mar 05 2022
%Y A275272 Cf. A037153, A005235, A275273, A275274, A000040.
%Y A275272 Cf. A000142, A187874.
%K A275272 nonn,easy
%O A275272 1,1
%A A275272 _Clark Kimberling_, Jul 23 2016