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 A321150 #28 Apr 16 2019 00:31:51 %S A321150 2,3,5,7,11,13,17,19,41,43,47,97,151,157,233,239,331,337,457,593,599, %T A321150 743,911,919,1301,1303,1307,1531,1783,1787,1789,2039,2311,2617,2939, %U A321150 3613,3617,4373,4783,4787,4789,5641,5647,6581,7079,7591,8111,8117,8677,9239,9829,11681,11689,13001,13003,13007 %N A321150 Primes p such that p minus its digit sum is a square. %H A321150 Robert Israel, <a href="/A321150/b321150.txt">Table of n, a(n) for n = 1..3000</a> %e A321150 11 is prime and 11 - (1+1) = 9 = 3^2 is square, so 11 is a term of the sequence. %e A321150 457 is prime and 457 - (4+5+7) = 441 = 21^2 is square, so 457 is a term of the sequence. %e A321150 2939 is prime and 2939 - (2+9+3+9) = 2916 = 54^2 is square, so 2939 is a term of the sequence. %e A321150 101 is prime and 101 - (1+0+1) = 99 is not square, so 101 is not a term of the sequence. %p A321150 select(t -> isprime(t) and issqr(t - convert(convert(t,base,10),`+`)), %p A321150 [2,seq(i,i=3..20000,2)]); # _Robert Israel_, Apr 15 2019 %t A321150 Select[Prime@ Range@ 2000, IntegerQ@ Sqrt[# - Total@ IntegerDigits@ #] &] (* _Michael De Vlieger_, Nov 05 2018 *) %o A321150 (PARI) isok(p) = isprime(p) && issquare(p-sumdigits(p)); \\ _Michel Marcus_, Oct 30 2018 %Y A321150 Cf. A000290, A007605, A007953, A245064, A068395. %Y A321150 Intersection of A000040 and A066566. %K A321150 nonn,base %O A321150 1,1 %A A321150 _Marius A. Burtea_, Oct 28 2018 %E A321150 a(26) corrected by _Robert Israel_, Apr 15 2019