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 A063792 #13 Jun 25 2018 08:55:18
%S A063792 2,3,5,7,13,29,31,41,47,53,61,79,83,97,103,113,131,139,151,157,193,
%T A063792 199,223,227,241,263,269,281,317,337,353,359,373,379,397,401,409,433,
%U A063792 443,461,463,487,503,521,557,571,593,599,601,613,617,631,647,653
%N A063792 Subtractive primes: p = x1x2x3..xk is a k-digit prime in base 10 such that abs(x1-x2-x3-...-xk) is also a prime.
%H A063792 Harry J. Smith, <a href="/A063792/b063792.txt">Table of n, a(n) for n = 1..1000</a>
%e A063792 269 belong to the sequence because |2 - 6 - 9| = |-13| = 13.
%t A063792 okQ[n_] := Module[{idn = -1# & /@ IntegerDigits[n]}, PrimeQ[Plus @@ Rest[idn] - First[idn]]]; Select[Prime[Range[120]], okQ]
%o A063792 (PARI) SubD(x)= { local(s); s=0; while (x>9, s+=x-10*(x\10); x\=10); return(abs(s - x)) }
%o A063792 { n=0; p=0; for (m=1, 10^9, p=nextprime(p+1); if(isprime(SubD(p)), write("b063792.txt", n++, " ", p); if (n==1000, break)) ) } \\ _Harry J. Smith_, Aug 31 2009
%K A063792 easy,nonn,base
%O A063792 1,1
%A A063792 _Felice Russo_, Aug 17 2001
%E A063792 Corrected by _Harvey P. Dale_, Aug 20 2001