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 A207973 #32 Aug 16 2022 16:05:25
%S A207973 2,31,43,67,107,151,167,179,227,233,389,509,547,661,719,769,823,829,
%T A207973 967,1033,1093,1259,1321,1493,1567,1733,1873,2099,2341,2539,2621,2683,
%U A207973 2819,2927,3119,3169,3373
%N A207973 Primes p such that the equation prime(p-k)+k! = prime(p) has at least one solution k>0.
%C A207973 Apart from the first entry, the majority of the entries stem from k=4, i.e., this is essentially a reverse lookup within A033560. - _R. J. Mathar_, Mar 15 2012
%e A207973 2 is in the sequence because prime(2) = prime(2-1)+1 = 3,
%e A207973 31 is in the sequence because prime(31) = prime(31-4)+1*2*3*4 = 103+24 = 127,
%e A207973 43 is in the sequence because prime(43) = prime(43-4)+1*2*3*4 = 167+24 = 191.
%o A207973 (PARI) is_A207973(n)={local(k);k=1;while((k<n)&&(prime(n-k)+k!)<prime(n),k=k+1);if((k<n)&&(prime(n-k)+k!)==prime(n),isprime(n),0)} \\ _Michael B. Porter_, Mar 22 2012
%Y A207973 Cf. A000040, A000142.
%K A207973 nonn
%O A207973 1,1
%A A207973 _Gerasimov Sergey_, Mar 02 2012