|
Search: id:A164968
|
|
|
| A164968 |
|
Naughty primes: primes in which the number of zeros is greater than the number of all other digits. |
|
+0
1
|
|
| 10007, 10009, 40009, 70001, 70003, 70009, 90001, 90007, 100003, 200003, 200009, 300007, 400009, 500009, 700001, 900001, 900007, 1000003, 1000033, 1000037, 1000039, 1000081, 1000099, 1000303
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(24)=1000303 is a naughty prime because the number of zeros is greater than the number of all other digits.
|
|
LINKS
|
M. F. Hasler, Table of n, a(n), for n=1,...,5000
Author?, The Prime Glossary
|
|
EXAMPLE
|
a(31) = 1003001 is the smallest palindromic naughty prime. [M. F. Hasler, Nov 22 2009]
|
|
PROGRAM
|
(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 this_sequence A165296 A101442 A023335
Adjacent sequences: A164965 A164966 A164967 this_sequence A164969 A164970 A164971
|
|
KEYWORD
|
base,nonn,new
|
|
AUTHOR
|
G. L. Honaker, Jr. (honak3r(AT)gmail.com), Sep 02 2009
|
|
|
Search completed in 0.002 seconds
|
