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 A260485 #19 Aug 11 2015 16:43:18 %S A260485 3,4,6,8,10,14,16,20,24,22,28,32,40,38,48,51,46,55,62,58,75,68,74,82, %T A260485 87,91,98,94,110,112,116,123,121,128,130,142,136,152,155,146,166,182, %U A260485 175,188,190,184,207,200,214,206,218,232,221,243,252,255,247,238 %N A260485 Smallest number m such that 2*m = OddPrime(n) + q, q prime, and 2*m - prime(k) is not prime for k less than n. %C A260485 a(n) = A260580(n,1); %C A260485 smallest number m such that the n-th odd prime p is needed to write 2*m = (p+q)/2. %H A260485 Reinhard Zumkeller, <a href="/A260485/b260485.txt">Table of n, a(n) for n = 1..1000</a> %o A260485 (Haskell) %o A260485 a260485 = head . a260580_row %Y A260485 Cf. A260580, A208662, A065091. %K A260485 nonn %O A260485 1,1 %A A260485 _Reinhard Zumkeller_, Aug 11 2015