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 A273597 #17 Mar 01 2020 12:18:27
%S A273597 39,38,37,35,34,32,31,29,26,25,22,20,19,17,14,12,11,12,12,12,12,16,15,
%T A273597 12,12,13,14,13,13,14,13,13,13,13,14,14,14,16,16,16,15,15,16,16,17
%N A273597 min { x >= 0 | A273595(n) + prime(n)*x + x^2 is composite }, where A273595(n) is such that this is a local maximum.
%C A273597 See A273595 for further information and (cross)references.
%C A273597 From the initial values, the sequence seems strictly decreasing, with a(n+1) - a(n) = (prime(n+1) - prime(n))/2; however, this property does not persist beyond n = 16.
%C A273597 This is the subsequence of A273770 with indices n corresponding to odd primes 2n+1, see formula. - _M. F. Hasler_, Feb 17 2020
%H A273597 <a href="/index/Pri">Index to entries related to primes produced by polynomials</a>.
%F A273597 a(n) = (81 - prime(n))/2 for 1 < n < 17.
%F A273597 a(n) = A273770((prime(n) - 1)/2). - _M. F. Hasler_, Feb 17 2020
%o A273597 (PARI) A273597(n)=A273770(prime(n)\2) \\ changed Feb 17 2020
%o A273597 (PARI) A273597(n,p=prime(n),q=A273756(p\2))={for(x=1,oo,isprime(q+p*x+x^2)||return(x))} \\ _M. F. Hasler_, Feb 17 2020
%Y A273597 Cf. A002837, A007634, A005846, A097823, A144051, A187057 .. A187060, A190800, A191456 ff.
%K A273597 nonn
%O A273597 2,1
%A A273597 _M. F. Hasler_, May 26 2016
%E A273597 Edited and extended using A273756(0..100) due to _Don Reble_, by _M. F. Hasler_, Feb 17 2020