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 A210767 #19 Apr 01 2019 14:00:01
%S A210767 11,12,14,16,21,23,25,29,32,34,38,41,43,47,52,58,61,67,74,76,83,85,89,
%T A210767 92,98,101,102,104,106,110,111,113,119,120,131,133,140,146,160,164,
%U A210767 166,179,191,197,201,203,205,209,210,223,230,232,250,269,290,296,302
%N A210767 Numbers whose digit sum as well as sum of the 4th powers of the digits is a prime.
%C A210767 This is to the exponent 4 as A182404 is to the exponent 2.
%H A210767 Charles R Greathouse IV, <a href="/A210767/b210767.txt">Table of n, a(n) for n = 1..10000</a>
%F A210767 {n such that A055013(n) and A007953(n) are both primes}.
%e A210767 21 is in the sequence because sum of digits 2+1= 3 is prime, and sum of the 4th powers of the digits 2^4+1^4=17 is a prime.
%t A210767 Select[Range[350],AllTrue[{Total[IntegerDigits[#]],Total[ IntegerDigits[ #]^4]},PrimeQ]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* _Harvey P. Dale_, Apr 01 2019 *)
%o A210767 (PARI) dspow(n,b,k)=my(s);while(n,s+=(n%b)^k;n\=b);s
%o A210767 select(n->isprime(sumdigits(n))&&isprime(dspow(n,10,4)), vector(10^3, i, i)) \\ _Charles R Greathouse IV_, May 11 2012
%Y A210767 Cf. A007953, A055013, A182404.
%K A210767 nonn,base,easy
%O A210767 1,1
%A A210767 _Jonathan Vos Post_, May 10 2012