|
%I #28 Oct 19 2014 09:46:53
%S 11,101,110,111,353,1001,1010,1011,1100,1101,1110,10001,10010,10011,
%T 10100,10101,10110,11000,11001,11010,11100,11111,62315,100001,100010,
%U 100011,100100,100101,100110,101000,101001,101010,101100,101111,110000,110001,110010
%N Numbers n such that d_1^n + d_2^n + ... + d_k^n is prime where d_i represents the i-th digit in the decimal representation of n.
%C The terms in A007088 with a prime number of 1's are trivially contained in this sequence.
%e 1011 is a member of this sequence because 1^1011 + 0^1011 + 1^1011 + 1^1011 = 3 is prime.
%o (Python)
%o import sympy
%o from sympy import isprime
%o def Pow(x):
%o ..num = 0
%o ..for i in str(x):
%o ....num += int(i)**x
%o ..if isprime(num):
%o ....return True
%o x = 1
%o while x < 10**5:
%o ..if Pow(x):
%o ....print(x)
%o ..x += 1
%Y Cf. A007088, A239237.
%K nonn,base
%O 1,1
%A _Derek Orr_, Mar 13 2014
%E a(12)-a(37) from _Giovanni Resta_, Mar 14 2014
|
