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 A092940 #8 Nov 07 2024 15:21:41
%S A092940 2,3,7,11,19,23,31,31,43,53,59,71,79,83,89,103,113,109,131,139,139,
%T A092940 151,163,173,191,199,199,211,211,223,251,257,271,271,293,283,311,313,
%U A092940 331,317,353,359,379,383,389,379,419,443,449,439,463,467,479,499,509,523
%N A092940 a(n) = largest prime p such that 2*prime(n) - p is prime.
%C A092940 a(n) = largest prime p such that prime(n) = (p+q)/2, where q is also prime.
%C A092940 prime(n) <= a(n) < 2*prime(n).
%C A092940 Conjecture: a(n) = prime(n) only for n = 1 and 2.
%F A092940 a(n) = 2*prime(n) - A092938(n).
%e A092940 2*prime(18) = 122; the primes smaller than 122 are 113, 109, 107, ... in descending order. 122 - 113 = 9 is not prime, but 122 - 109 = 13 is prime, hence a(18) = 109.
%o A092940 (PARI) {for(n=1,56,k=2*prime(n);q=2;while(!isprime(p=k-q),q=nextprime(q+1));print1(p,","))} \\ Klaus Brockhaus, Dec 23 2006
%Y A092940 Cf. A092938, A092939, A116619.
%K A092940 nonn
%O A092940 1,1
%A A092940 _Amarnath Murthy_, Mar 23 2004
%E A092940 Edited and extended by _Klaus Brockhaus_, Dec 23 2006