|
| |
|
|
A164968
|
|
Naughty primes: primes in which the number of zeros is greater than the number of all other digits.
|
|
5
| |
|
|
10007, 10009, 40009, 70001, 70003, 70009, 90001, 90007, 100003, 200003, 200009, 300007, 400009, 500009, 700001, 900001, 900007, 1000003, 1000033, 1000037, 1000039, 1000081, 1000099, 1000303, 1000403, 1000409, 1000507, 1000609, 1000907, 1001003, 1003001
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| a(31) = 1003001 is the smallest palindromic naughty prime. [M. F. Hasler, Nov 22 2009]
|
|
|
LINKS
| M. F. Hasler, Table of n, a(n), for n=1,...,5000
Chris Caldwell, The Prime Glossary, Naughty prime
|
|
|
EXAMPLE
| a(24)=1000303 is a naughty prime because the number of zeros is greater than the number of all other digits.
|
|
|
MATHEMATICA
| lst = {}; Do[If[PrimeQ[n] && Count[IntegerDigits[n], 0] > IntegerLength[n]/2, AppendTo[lst, n]], {n, 10^4, 3^13}]; lst (* Arkadiusz Wesolowski, Sep 18 2011 *)
|
|
|
PROG
| (PARI) next_ A164968(p)={ for( n=#Str(p)\2+1, 1e9, p=max(10^(2*n-3), p); while( 10^(2*n-1)>p=nextprime(p+1), vecsort(Vecsmall(Str(p)))[n]==48 & return(p)); p=0) } \\ [M. F. Hasler, Nov 22 2009]
|
|
|
CROSSREFS
| Sequence in context: A082567 A031688 A031598 * A165296 A182697 A101442
Adjacent sequences: A164965 A164966 A164967 * A164969 A164970 A164971
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| G. L. Honaker, Jr. (honak3r(AT)gmail.com), Sep 02 2009
|
| |
|
|
