

A155555


Primes p such that (number of prime digits of p) < (number of prime digits of prime(p)).


2



11, 19, 31, 41, 59, 61, 67, 71, 101, 103, 107, 109, 131, 137, 139, 149, 151, 181, 191, 199, 211, 241, 269, 281, 307, 311, 331, 349, 367, 389, 401, 409, 419, 439, 449, 457, 461, 463, 467, 479, 491, 499, 503, 509, 521, 569, 587, 599, 601, 613, 619, 641, 643
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

Prime digits are 2, 3, 5, 7.


LINKS



PROG

(PARI) dp(n)=d=digits(n); c=0; for(i=1, #d, if(isprime(d[i]), c+=1)); c
forprime(p=1, 500, if(dp(p)<dp(prime(p)), print1(p, ", "))) \\ Derek Orr, Feb 28 2017


CROSSREFS



KEYWORD

nonn,base,less


AUTHOR



EXTENSIONS



STATUS

approved



