login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A155056 Primes p such that number of prime digits of prime(p) > number of nonprime digits of prime(p). 0

%I #14 Apr 11 2023 11:41:53

%S 2,3,31,37,59,61,67,71,73,101,103,107,131,137,139,151,241,269,307,331,

%T 349,367,457,461,491,499,503,509,521,587,727,733,739,823,827,907,929,

%U 937,953,983,1033,1049,1063

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

%C Prime digits are 2, 3, 5, 7, nonprime digits are 0, 1, 4, 6, 8, 9.

%t pgnQ[p_]:=Count[IntegerDigits[Prime[p]],_?(MemberQ[{2,3,5,7},#]&)]>IntegerLength[ Prime[p]]/2; Select[Prime[Range[200]],pgnQ] (* _Harvey P. Dale_, Apr 11 2023 *)

%Y Cf. A000040, A141468.

%K nonn,base,less

%O 1,1

%A _Juri-Stepan Gerasimov_, Jan 19 2009

%E Corrected (269 inserted) by _R. J. Mathar_, May 05 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 7 21:53 EDT 2024. Contains 372317 sequences. (Running on oeis4.)