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 A050705 #16 Jul 03 2017 02:05:17
%S A050705 10,12,14,15,20,21,26,33,35,38,44,48,51,65,68,86,93,96,111,112,116,
%T A050705 123,161,188,201,203,206,209,210,215,221,278,297,300,304,306,321,352,
%U A050705 356,371,384,395,398,413,420,441,471,485,524,533,543,545,546,551,570,626
%N A050705 Composite number such that when sum of its prime factors is added or subtracted becomes prime.
%C A050705 Prime factors counted with multiplicity, e.g., 44 = 2*2*11 so the sum of its prime factors is 15 (not 13). - _Harvey P. Dale_, May 30 2012
%H A050705 Harvey P. Dale, <a href="/A050705/b050705.txt">Table of n, a(n) for n = 1..1000</a>
%e A050705 E.g., 545 = 5*109 so 545 +- (5+109) = 545 +- 114 = 659 and 431 and both are primes.
%t A050705 spfQ[n_]:=Module[{s=Total[Times@@@FactorInteger[n]]},!PrimeQ[n] && PrimeQ[ n+s]&&PrimeQ[n-s]]; Select[Range[700],spfQ] (* _Harvey P. Dale_, May 30 2012 *)
%o A050705 (PARI) lista(nn) = {forcomposite(n=2, nn, f = factor(n); sopfr = sum(j=1, #f~, f[j, 1]*f[j, 2]); if (isprime(n+sopfr) && isprime(n-sopfr), print1(n, ", ")););} \\ _Michel Marcus_, Jul 03 2017
%Y A050705 Cf. A050703, A050704, A050706, A050707, A050708, A050709, A050710.
%K A050705 nonn,nice
%O A050705 1,1
%A A050705 _Patrick De Geest_, Aug 15 1999