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 A244207 #29 Feb 06 2021 15:21:46
%S A244207 98,122,128,148,190,208,220,250,292,302,308,326,332,346,368,398,410,
%T A244207 418,430,458,476,488,500,518,532,538,556,586,628,640,670,692,700,710,
%U A244207 718,728,752,770,782,788,796,806,820,838,848,854,872,878,896,902,908,920
%N A244207 Numbers 2m such that A020482(m) != A060308(m-1).
%C A244207 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, called "b numbers" ("b-Zahlen") by Nils Johan Pipping.
%C A244207 Almost all numbers are in the sequence. Only the beginning of the sequence is sparse. - _Jens Kruse Andersen_, Jul 12 2014
%C A244207 Let p be the smallest prime < 2n such that 2n-p is prime, and let r < 2n be the smallest odd nonprime > 1 such that 2n-r is prime; this sequence lists the numbers 2n for which r < p. - _David James Sycamore_, Jan 14 2019
%H A244207 Jens Kruse Andersen, <a href="/A244207/b244207.txt">Table of n, a(n) for n = 1..10000</a>
%e A244207 From _David James Sycamore_, Jan 14 2019: (Start)
%e A244207 98 is a term because (see 3rd comment above) p = 11 and r = 9.
%e A244207 128 is a term because then p = 19 and r = 15.
%e A244207 908 is a term because then p = 31 and r = 21. (End)
%o A244207 (PARI) for(m=2, 1000, p=precprime(2*m-2); if(!isprime(2*m-p), print1(2*m", "))) \\ _Jens Kruse Andersen_, Jul 12 2014
%Y A244207 Cf. A020482, A060308. Equals twice A135145.
%K A244207 nonn
%O A244207 1,1
%A A244207 _Ivan Panchenko_, Jun 22 2014