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 A135145 #20 Jul 13 2014 10:03:01
%S A135145 49,61,64,74,95,104,110,125,146,151,154,163,166,173,184,199,205,209,
%T A135145 215,229,238,244,250,259,266,269,278,293,314,320,335,346,350,355,359,
%U A135145 364,376,385,391,394,398,403,410,419,424,427,436,439,448,451,454,460
%N A135145 Values of m where A020482(m) != A060308(m-1).
%C A135145 Usually the greatest p with p,q both prime, p+q = 2m, is equal to the largest prime <= 2m-2, but not always. These are the exceptions.
%C A135145 Almost all natural numbers are in the sequence so the above comment is misleading in general, and only fitting for small numbers. - _Jens Kruse Andersen_, Jul 13 2014
%H A135145 Jens Kruse Andersen, <a href="/A135145/b135145.txt">Table of n, a(n) for n = 1..10000</a>
%t A135145 a2[n_] := {p, q} /. {ToRules @ Reduce[p+q == 2*n, {p, q}, Primes]} // Max; a8[n_] := Max[FactorInteger[(2*n)!/n!^2]]; Select[Range[500], a2[#] != a8[#-1]&] (* _Jean-François Alcover_, Dec 19 2013 *)
%o A135145 (PARI) for(m=2, 1000, p=precprime(2*m-2); if(!isprime(2*m-p), print1(m", "))) \\ _Jens Kruse Andersen_, Jul 12 2014
%Y A135145 Cf. A020482, A060308.
%K A135145 nonn
%O A135145 1,1
%A A135145 _Harry J. Smith_, Nov 20 2007