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 A110673 #41 Jun 12 2024 17:06:21
%S A110673 23,37,47,53,67,79,83,89,93,97,113,117,119,121,123,127,131,143,145,
%T A110673 157,163,167,173,185,187,203,205,207,211,215,217,219,223,233,245,247,
%U A110673 251,257,263,277,287,289,293,297,299,301,303,307,317,321,323,325,327,331
%N A110673 Numbers that are neither the sum nor the difference of two primes.
%C A110673 The sequence is obtained by interleaving A099019 and A134797. From Goldbach's conjecture, apparently all terms are odd. - _Bob Selcoe_, Mar 10 2015
%C A110673 Intersection of A007921 and A014092. - _Michel Marcus_, Mar 16 2015
%H A110673 Michel Marcus, <a href="/A110673/b110673.txt">Table of n, a(n) for n = 1..7596</a>
%H A110673 Oliver Knill, <a href="https://arxiv.org/abs/1606.05958">Goldbach for Gaussian, Hurwitz, Octavian and Eisenstein primes</a>, arXiv preprint arXiv:1606.05958 [math.NT], 2016.
%H A110673 Wikipedia, <a href="http://en.wikipedia.org/wiki/Goldbach%27s_conjecture">Goldbach's conjecture</a>
%t A110673 Lim=331; nn=PrimePi[Lim+1]; (* Lim is upper limit of sequence; nn is range of primes to consider *)
%t A110673 dif=Union[Flatten[Differences/@Subsets[Prime[Range[nn]],{2}]]]; (* differences of two primes *)
%t A110673 sum=Union[Join[Flatten[Total/@Subsets[Prime[Range[nn]],{2}]],Table[2*Prime[n], {n, nn}]]];seq2; (* sums of two primes *)
%t A110673 Complement[Range[Lim],dif,sum] (* neither sum nor difference *) (* _James C. McMahon_, Jun 10 2024 *)
%Y A110673 Cf. A007921 (not the difference), A014092 (not the sum).
%Y A110673 Cf. also A099019, A134797.
%K A110673 easy,nonn
%O A110673 1,1
%A A110673 _Eric Angelini_, Sep 14 2005
%E A110673 Corrected and extended by _Joshua Zucker_, May 04 2006
%E A110673 Offset corrected by _Arkadiusz Wesolowski_, May 19 2012