login
Primes p such that (number of prime digits of p) > (number of prime digits of prime(p)).
2

%I #20 Feb 19 2021 02:57:41

%S 5,13,23,29,43,53,79,127,157,167,173,223,227,229,233,239,257,263,271,

%T 277,283,293,313,317,337,353,373,379,433,523,557,563,577,647,757,773,

%U 797,839,853,859,863,887,977,1103,1117,1123,1153,1171,1187,1193,1217

%N Primes p such that (number of prime digits of p) > (number of prime digits of prime(p)).

%H Harvey P. Dale, <a href="/A155552/b155552.txt">Table of n, a(n) for n = 1..1000</a>

%t Select[Prime[Range[200]],Count[IntegerDigits[#],_?PrimeQ]> Count[ IntegerDigits[ Prime[#]],_?PrimeQ]&] (* _Harvey P. Dale_, May 08 2012 *)

%Y Cf. A000040, A109066, A155555.

%K nonn,base,less

%O 1,1

%A _Juri-Stepan Gerasimov_, Jan 24 2009

%E Corrected (337 inserted, 761 removed etc.) by _R. J. Mathar_, May 15 2010