Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Aug 14 2019 13:31:20
%S 2,3,5,7,11,12,14,16,21,23,27,29,32,34,38,41,43,47,54,56,61,65,67,74,
%T 83,87,89,92,98,101,102,104,106,110,111,113,115,119,120,122,126,128,
%U 131,133,137,139,140,142,146,153,155,160,164,166,173,179,182,186,188,191
%N Numbers n such that d_1^r + ... + d_r^1 is a prime number, where d_i are the digits of n (n = d_1, ..., d_r).
%H Harvey P. Dale, <a href="/A139749/b139749.txt">Table of n, a(n) for n = 1..1000</a>
%e 1^3 + 3^2 + 7^1 = 17 is prime. Thus 137 is a member of this sequence. - _Derek Orr_, Jul 13 2014
%t Select[Range[200],PrimeQ[Total[IntegerDigits[#]^Range[IntegerLength[#],1,-1]]]&] (* _Harvey P. Dale_, Aug 14 2019 *)
%o (PARI) for(n=1,10^3,d=digits(n);s=sum(i=1,#d,d[i]^(#d-i+1));if(isprime(s),print1(n,", "))) \\ _Derek Orr_, Jul 13 2014
%Y Cf. A139751.
%K base,easy,nonn,less
%O 1,1
%A _Ctibor O. Zizka_, May 19 2008
%E Edited and extended by _Klaus Brockhaus_, May 21 2008