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 A225534 #20 Mar 16 2016 16:15:44 %S A225534 11,101,110,111,113,115,122,124,128,131,139,142,146,148,151,155,164, %T A225534 166,182,184,193,199,212,214,218,221,223,227,232,236,238,241,245,254, %U A225534 256,263,265,269,272,278,281,283,287,289,296,298,311,319,322,326,328,335 %N A225534 Numbers whose sum of cubed digits is prime. %C A225534 Note that 11 is the only two-digit number in the sequence. %C A225534 a(n) ~ n. For 414 < n < 10000, 6.38*n - 528 provides an estimate of a(n) to within 6%. %H A225534 Christian N. K. Anderson, <a href="/A225534/b225534.txt">Table of n, a(n) for n = 1..10000</a> %e A225534 139 is in the sequence because 1^3 + 3^3 + 9^3 = 757, which is prime. %t A225534 Select[Range[350],PrimeQ[Total[IntegerDigits[#]^3]]&] (* _Harvey P. Dale_, Mar 16 2016 *) %o A225534 (R) %o A225534 digcubesum<-function(x) sum(as.numeric(strsplit(as.character(x),split="")[[1]])^3); library(gmp); %o A225534 which(sapply(1:1000,function(x) isprime(digcubesum(x))>0)) %Y A225534 Cf. A197039, A055012, A046459, A225535. %Y A225534 Cf. A165330, A046197. %Y A225534 Cf. A046704, A023194. %K A225534 nonn,base %O A225534 1,1 %A A225534 _Kevin L. Schwartz_ and _Christian N. K. Anderson_, May 10 2013