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 A212266 #44 Dec 01 2023 13:31:46
%S A212266 59,73,79,89,101,109,197,211,239,241,263,281,307,337,367,373,379,409,
%T A212266 419,421,439,443,449,461,463,491,523,547,557,571,593,601,613,617,631,
%U A212266 647,653,659,673,701,709,769,797,811,839,853,863,881,907,929,937,941,967
%N A212266 Primes p such that p - m! is composite, where m is the greatest number such that m! < p.
%C A212266 The first five terms 59, 73, 79, 89, 101 belong to A023209. The terms 409, 419, 421, 439, 443, 449 also belong to A127209.
%C A212266 It seems likely that a(n) ~ n log n, can this be proved? - _Charles R Greathouse IV_, Sep 20 2012
%H A212266 Charles R Greathouse IV, <a href="/A212266/b212266.txt">Table of n, a(n) for n = 1..10000</a>
%e A212266 29 is not a member because 29 - 4! = 5 is prime.
%e A212266 59 is a member because 59 - 4! = 35 is composite.
%t A212266 Select[Prime[Range[200]],Module[{m=9},CompositeQ[While[m!>=#,m--];#-m!]]&] (* The initial m constant (set at 9 in the program) needs to be increased if the prime Range constant (set at 200 in the program) is increased beyond 30969. *) (* _Harvey P. Dale_, Dec 01 2023 *)
%o A212266 (PARI) for(n=3,5,N=n!;forprime(p=N+3,N*(n+1),if(!isprime(p-N), print1(p", ")))) \\ _Charles R Greathouse IV_, May 12 2012
%o A212266 (PARI) is_A212266(p)=isprime(p) && for(n=1,p, n!<p || return(bigomega(p-(n-1)!)>1)) \\ _M. F. Hasler_, May 20 2012
%Y A212266 Cf. A212600, A212598, A136437, A023209, A127209.
%K A212266 nonn,easy
%O A212266 1,1
%A A212266 _Balarka Sen_, May 12 2012