|
| |
|
|
A155054
|
|
Primes n such that number of prime digits of prime(n) < number of nonprime digits of prime(n).
|
|
0
| |
|
|
5, 13, 29, 41, 43, 47, 53, 79, 83, 89, 97, 109, 113, 127, 149, 157, 163, 167, 173, 179, 181, 193, 197, 223, 229, 233, 239, 257, 263, 271, 283, 293, 313, 317, 379, 421, 431, 433, 443, 449, 487, 541, 563, 601, 607, 617, 631, 647, 661, 691, 719, 761, 773, 797
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Prime digit = 2, 3, 5 or 7. Nonprime digit = 0, 1, 4, 6, 8 or 9.
|
|
|
FORMULA
| If n=5=prime and 11=prime(5), then 0<2(1 and 1) and 5=a(1). If n=13=prime and 41=prime(13), then 0<2(4 and 1) and 13=a(2). If n=29=prime and 109=prime(23), then 0<3(1, 0 and 9) and 29=a(3). If n=41=prime and 179=prime(41), then 1(7)<(1 and 9) and 41=a(4), etc.
|
|
|
EXAMPLE
| If n=41=prime and 179=prime(41), then 1(7)<2(1 and 9) and 41=a(4). If n=43=prime and 191=prime(43), then 0<3(1, 9 and 1) and 43=a(5). If n=47=prime and 211=prime(47), then 1(2)<2(1 and 1) and 47=a(6), etc.
|
|
|
MATHEMATICA
| okQ[n_]:=Module[{idn=IntegerDigits[Prime[n]]}, Count[idn, _?PrimeQ]< Length[idn]/2]; Select[Prime[Range[200]], okQ] (* From Harvey P. Dale, Apr 20 2011 *)
|
|
|
CROSSREFS
| Cf. A000040, A141468.
Sequence in context: A100877 A007521 A078598 * A158756 A185086 A159351
Adjacent sequences: A155051 A155052 A155053 * A155055 A155056 A155057
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jan 19 2009
|
|
|
EXTENSIONS
| Corrected (277, 419 removed) by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 05 2010
|
| |
|
|
