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 A156753 #9 Apr 03 2023 10:36:11
%S A156753 11,101,167,211,257,347,431,523,541,617,743,761,853,1021,1087,1153,
%T A156753 1201,1373,1427,1483,1531,1571,1607,1733,1861,2011,2053,2141,2237,
%U A156753 2251,2273,2383,2411,2417,2503,2521,2741,2833,2851,3041,3137,3371,3407,3511,3823
%N A156753 Primes whose largest digit is equal to the sum of all the other digits.
%H A156753 Harvey P. Dale, <a href="/A156753/b156753.txt">Table of n, a(n) for n = 1..1000</a>
%H A156753 Chris Caldwell, <a href="https://t5k.org/lists/small/1000.txt">The First 1,000 Primes</a>
%e A156753 1571 is a prime in which the largest digit is equal to the sum of all the other digits.
%p A156753 A054055 := proc(n) max(op(convert(n,base,10))) ; end: A007953 := proc(n) add(d,d=convert(n,base,10)) ; end: for n from 1 to 800 do p := ithprime(n) ; if 2*A054055(p) = A007953(p) then printf("%d,",p) ; fi; od: # _R. J. Mathar_, Feb 20 2009
%t A156753 ldQ[n_]:=Module[{c=Sort[IntegerDigits[n]]},Total[Most[c]]==Last[c]]; Select[ Prime[Range[1000]],ldQ] (* _Harvey P. Dale_, Dec 26 2013 *)
%Y A156753 Cf. A000040.
%K A156753 nonn,base
%O A156753 1,1
%A A156753 _Parthasarathy Nambi_, Feb 14 2009
%E A156753 11 added in front and extended by _R. J. Mathar_, Feb 20 2009