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 A135275 #12 Oct 08 2016 02:14:11
%S A135275 0,1,7,13,21,27,37,41,53,65,69,75,95,101,95,121,127,143,153,161,169,
%T A135275 187,185,207,223,231,235,251,263,275,269,305,299,321,343,345,361,373,
%U A135275 385,391,409,425,433,445,457,459,479,493,507,517
%N A135275 a(n) = prime(2n-1) + prime(2n) - prime(2n+1).
%C A135275 Original name was: Sum and difference of staircase primes according to the rule: bottom + top - next top.
%H A135275 G. C. Greubel, <a href="/A135275/b135275.txt">Table of n, a(n) for n = 1..1000</a>
%F A135275 We list the primes in staircase fashion as in A135274. The right diagonal, RD(n), is the set of top primes and the left diagonal, LD(x), is the set of bottom primes. Then a(n) = LD(n+1) + RD(n) - RD(n+2).
%F A135275 a(n) = A096379(2*n-1). - _R. J. Mathar_, Sep 10 2016
%t A135275 Table[Prime[n + 1] + Prime[n] - Prime[n + 2], {n, 1, 30}][[;; ;; 2]] (* _G. C. Greubel_, Oct 08 2016 *)
%o A135275 (PARI) g(n) = forstep(x=1,n,2,y=prime(x+1)+ prime(x)- prime(x+2);print1(y","))
%o A135275 (PARI) n=1; p=2; q=3; forprime(r=5,1e3, if(n, print1(p+q-r", ")); n=!n; p=q; q=r) \\ _Charles R Greathouse IV_, Oct 08 2016
%Y A135275 Cf. A096379, A135274.
%K A135275 nonn,easy
%O A135275 1,3
%A A135275 _Cino Hilliard_, Dec 02 2007
%E A135275 New name from _Charles R Greathouse IV_, Oct 08 2016