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

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

Offset

1,1

Comments

Prime digits are 2, 3, 5, 7.

Links

John Cerkan, Table of n, a(n) for n = 1..10000

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

Cf. A000040, A109066, A155552.

Sequence in context: A196669 A322548 A049719 * A357426 A152091 A272550

Adjacent sequences: A155552 A155553 A155554 * A155556 A155557 A155558

Keyword

nonn,base,less

Author

Juri-Stepan Gerasimov, Jan 24 2009

Extensions

Corrected (87 removed) by R. J. Mathar, May 15 2010

Status

approved