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 A281290 #16 Feb 18 2017 02:40:52 %S A281290 37,59,73,127,149,239,271,293,307,419,491,509,941,1049,1061,1117,1171, %T A281290 1193,1229,1319,1409,1601,1913,1931,2017,2039,2129,2309,2903,3119, %U A281290 3191,3209,3911,4019,4091,5009,6011,6101,9041,9203,9221,9311,10061,10139,10193 %N A281290 Primes p where the difference between the largest digit of p and sum of all other digits equals 4. %H A281290 Charles R Greathouse IV, <a href="/A281290/b281290.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..2579 from Lars Blomberg) %e A281290 37 is a term since 7 - 3 = 4. %e A281290 9221 is a term, since 9 - (2 + 2 + 1) = 4. %t A281290 Select[Prime@ Range[10^3], Fold[#1 - #2 &, First@ #, Rest@ #] == 4 &@ Reverse@ Sort@ IntegerDigits@ # &] (* _Michael De Vlieger_, Feb 08 2017 *) %o A281290 (PARI) is(n)=my(d=digits(n)); 2*vecmax(d)==vecsum(d)+4 && isprime(n) \\ _Charles R Greathouse IV_, Feb 18 2017 %o A281290 (PARI) do(d)=my(v=List()); for(len=1,d, for(b=5,9, for(e=0,len-1, my(t=b*10^e,n,dig); forvec(u=vector(b-4,i,[0,len-1]), n=t+sum(i=1,#u,10^u[i]); if(!isprime(n), next); dig=digits(n); if(2*vecmax(dig)==vecsum(dig)+4, listput(v,n)), 1)))); Set(v) \\ _Charles R Greathouse IV_, Feb 18 2017 %Y A281290 A subsequence of A280915. %Y A281290 Cf. A000040. %K A281290 nonn,base %O A281290 1,1 %A A281290 _Osama Abuajamieh_, Jan 19 2017 %E A281290 More terms from _Lars Blomberg_, Feb 18 2017