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 A049613 #12 Jan 02 2015 16:00:14
%S A049613 3,3,3,5,3,3,5,3,3,5,3,5,7,3,3,5,7,3,5,3,3,5,3,5,7,3,5,7,3,3,5,7,3,5,
%T A049613 3,3,5,7,3,5,3,5,7,3,5,7,9,3,5,3,3,5,3,3,5,3,5,7,9,11,13,15,3,5,3,5,7,
%U A049613 3,3,5,7,9,11,3,3,5,7,3,5,7,3,5,3,5,7,3,5,7,3,3,5
%N A049613 a(n) = 2n - (largest prime < 2n-2).
%H A049613 T. D. Noe, <a href="/A049613/b049613.txt">Table of n, a(n) for n=3..10000</a>
%F A049613 a(n) <= A002373(n). - _R. J. Mathar_, Mar 19 2008
%F A049613 a(n) = 2*n - A007917(2*n-2). - _Reinhard Zumkeller_, Jan 02 2015
%e A049613 a(14)=28 - (largest prime < 26) = 28 - 23 = 5.
%t A049613 Table[2n-NextPrime[2n-2,-1],{n,3,100}] (* _Harvey P. Dale_, Aug 16 2011 *)
%o A049613 (Haskell)
%o A049613 a049613 n = 2 * n - a007917 (2 * n - 2)
%o A049613 -- _Reinhard Zumkeller_, Jan 02 2015
%Y A049613 Cf. A049653, A049711, A049716, A049847.
%Y A049613 Cf. A002373, A020481, A007917.
%K A049613 nice,nonn,easy
%O A049613 3,1
%A A049613 David M. Elder (elddm(AT)rhodes.edu)