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 A242368 #46 Nov 07 2021 17:19:32
%S A242368 2,17,347,521,10601,28541,29759,32027,39569,58061,62969,100469,109541,
%T A242368 120401,130307,205357,398129,426383,434261,829883,896771,923501,
%U A242368 935063,1190261,1216583,1261109,1559963,1697771,2105381,2128649,2505857,2778851,2886563,2920649
%N A242368 Primes p such that p + digitsum(p) = q^k for some prime q and k > 1 where digitsum(n) = A007953(n).
%C A242368 With k>1 the number of entries is greatly reduced compared to simply allowing p+digsum(p) = q. One could allow for k=1 to see how many entries could be found for a variation of this sequence.
%H A242368 Kevin P. Thompson, <a href="/A242368/b242368.txt">Table of n, a(n) for n = 1..1000</a> (first 181 terms from Michel Marcus)
%e A242368 a(4)=521 because 521+5+2+1=529=23^2 and 23 is a prime.
%t A242368 a242368[n_Integer] := Module[{p, pp}, p = Prime[n]; pp = p + Plus @@ IntegerDigits@p; If[And[Length@FactorInteger[pp] == 1,
%t A242368 Min[Last@Transpose[FactorInteger[pp]]] > 1], p, 0]]; Rest@Sort@DeleteDuplicates[a242368 /@ Range[10^6]] (* _Michael De Vlieger_, Aug 16 2014 *)
%o A242368 (PARI) dsum(n)=n=digits(n); sum(i=1,#n,n[i])
%o A242368 is(p)=isprimepower(p+dsum(p))>1 && isprime(p)
%o A242368 forprime(p=2,1e9,if(is(p), print1(p", "))) \\ _Charles R Greathouse IV_, Aug 16 2014
%Y A242368 Cf. A000040, A007953, A007605, A000961.
%K A242368 nonn,base
%O A242368 1,1
%A A242368 _J. M. Bergot_, Aug 16 2014
%E A242368 More terms from _Charles R Greathouse IV_, Aug 16 2014