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 A280915 #23 Feb 05 2017 20:06:40 %S A280915 11,23,37,43,59,67,73,89,101,113,127,131,149,157,167,179,197,211,239, %T A280915 241,257,263,269,271,293,307,311,337,347,359,373,419,421,431,449,461, %U A280915 491,509,523,541,571,593,607,617,641,719,733,743,751,761,809,853,941,953,971,1013,1021,1031 %N A280915 Primes where difference between largest digit and all other digits is a positive square. %C A280915 If the largest digit L (say) is repeated, the criterion is that that L - (sum of all digits except for one copy of L) is a square. %H A280915 Charles R Greathouse IV, <a href="/A280915/b280915.txt">Table of n, a(n) for n = 1..10000</a> %e A280915 Prime 1153 is in a(n) since 5-3-1-1=0. Zero is square. %e A280915 Prime 1163 is in a(n) since 6-3-1-1=1. One is square. %e A280915 Prime 1171 is in a(n) since 7-1-1-1=4. Four is square. %t A280915 Select[Prime@ Range@ 175, IntegerQ@ Sqrt@ Fold[#1 - #2 &, Max@ #, Rest@ #] &@ Reverse@ Sort@ IntegerDigits@ # &] (* _Michael De Vlieger_, Feb 02 2017 *) %o A280915 (PARI) is(n)=my(d=digits(n)); issquare(2*vecmax(d)-vecsum(d)) && isprime(n) \\ _Charles R Greathouse IV_, Feb 05 2017 %Y A280915 This sequence is a parent sequence of A156753. %K A280915 nonn,base %O A280915 1,1 %A A280915 _Osama Abuajamieh_, Jan 10 2017