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 A168565 #13 Nov 04 2017 14:59:33
%S A168565 4,7,10,16,19,25,28,34,43,46,55,61,64,70,79,88,91,100,106,109,118,124,
%T A168565 133,145,151,154,160,163,169,190,196,205,208,223,226,235,244,250,259,
%U A168565 268,271,286,289,295,298,316,334,340,343,349,358,361,376,385,394,403
%N A168565 Let p = prime(n); then a(n) = p + (p-1)/2.
%C A168565 Also numbers n such that (2n + 1)/3 is prime. - Vicente Izquierdo Gomez, Dec 30 2012
%F A168565 a(n) = (3*prime(n)-1)/2.
%e A168565 3+2/2=4, 5+4/2=7, 7+6/2=10, 11+10/2=16,..
%t A168565 f[n_]:=n/2; lst={};Do[p=Prime[n];AppendTo[lst,p+f[p-1]],{n,2,5!}];lst
%t A168565 #+(#-1)/2&/@Prime[Range[2,60]] (* _Harvey P. Dale_, Nov 04 2017 *)
%Y A168565 Cf. A162939.
%K A168565 nonn
%O A168565 2,1
%A A168565 _Vladimir Joseph Stephan Orlovsky_, Nov 30 2009
%E A168565 Edited by _N. J. A. Sloane_, Jan 04 2013