|
Search: id:A072185
|
|
|
| A072185 |
|
Primes p = x1x2x3...xn in base 10 such that x1^p1+x2^p2+x3^p3+....+xn^pn is a prime, where pn is the n-th prime. |
|
+0
1
|
|
| 11, 23, 29, 41, 43, 47, 61, 67, 101, 131, 139, 151, 173, 179, 199, 263, 311, 331, 337, 359, 401, 461, 593, 601, 607, 641, 757, 809, 821, 827, 863, 881, 887, 911, 953, 977, 991, 1019, 1091
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
23 belongs to the sequence because 2^2+3^3=31 is a prime.
|
|
PROGRAM
|
30 for I=10 to 100000 40 L=alen(I) 50 Q=2:A=0 60 A1=val(mid(str(I), 2, 1)) 70 for H=2 to L 80 A=A+val(mid(str(I), H+1, 1))^nxtprm(Q) 90 Q=nxtprm(Q) 100 next 110 P=A+A1^2 120 if prmdiv(P)=P and P<>1 and prmdiv(I)=I and I<>1 then print I 130 next
|
|
CROSSREFS
|
Adjacent sequences: A072182 A072183 A072184 this_sequence A072186 A072187 A072188
Sequence in context: A088136 A086244 A091939 this_sequence A105898 A136001 A038904
|
|
KEYWORD
|
easy,base,nonn
|
|
AUTHOR
|
Felice Russo (felice.russo(AT)katamail.com), Jul 01 2002
|
|
|
Search completed in 0.002 seconds
|
