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 A120937 #6 Dec 17 2019 13:51:02
%S A120937 3,5,23,53,211,211,211,1847,2179,2179,3967,16033,16033,24281,24281,
%T A120937 24281,38501,38501,38501,38501,38501,58831,203713,206699,206699,
%U A120937 413353,413353,413353,1272749,1272749,1272749,1272749,2198981,2198981,2198981
%N A120937 Least prime such that the distance to the two adjacent primes is 2n or greater.
%C A120937 Erdos and Suranyi call these reclusive primes and prove that such a prime exists for all n. Except for a(0), the record values are in A023186.
%D A120937 Paul Erdős and Janos Suranyi, Topics in the theory of numbers, Springer, 2003.
%e A120937 a(3)=53 because the adjacent primes 47 and 59 are at distance 6 and all smaller primes have a closer distance.
%t A120937 k=2; Table[While[Prime[k]-Prime[k-1]<2n || Prime[k+1]-Prime[k]<2n, k++ ]; Prime[k], {n,0,40}]
%Y A120937 Cf. A023186, A087770, A330428.
%K A120937 nonn
%O A120937 0,1
%A A120937 _T. D. Noe_, Jul 21 2006