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 A139750 #13 Jul 14 2014 21:29:30
%S A139750 2,3,5,7,11,12,14,16,20,21,23,29,30,32,34,38,41,43,45,47,50,56,61,65,
%T A139750 70,72,74,76,78,83,89,92,98,101,110,111,113,115,120,122,131,133,137,
%U A139750 139,140,146,153,155,160,164,182,186,188,191,193,199,200,201,203,205,210
%N A139750 Numbers n such that d_1^1 + ... + d_r^r is a prime number, where d_i are the digits of n (n = d_1, d_2, ..., d_r).
%H A139750 Harvey P. Dale, <a href="/A139750/b139750.txt">Table of n, a(n) for n = 1..1000</a>
%e A139750 1^1+8^2+8^3 = 577 is prime. Thus 188 is a member of this sequence. - _Derek Orr_, Jul 13 2014
%t A139750 dpnQ[n_]:=Module[{idn=IntegerDigits[n]},PrimeQ[Total[idn^Range[ Length[idn]]]]]; Select[Range[300],dpnQ] (* _Harvey P. Dale_, Mar 26 2012 *)
%o A139750 (PARI) for(n=1,10^3,d=digits(n);s=sum(i=1,#d,d[i]^i);if(isprime(s),print1(n,", "))) \\ _Derek Orr_, Jul 13 2014
%Y A139750 Cf. A139752.
%K A139750 base,easy,nonn,less
%O A139750 1,1
%A A139750 _Ctibor O. Zizka_, May 19 2008
%E A139750 Edited and extended by _Klaus Brockhaus_, May 21 2008