|
Search: id:A099268
|
|
|
| A099268 |
|
For each single digit {0,1,...,9} record the smallest prime made up of copies of that digit or 0 if no such prime exists; repeat for all of the C(10,2) = 45 pairs of distinct decimal digits; then for all triples; etc. |
|
+0
1
|
|
| 0, 11, 2, 3, 0, 5, 0, 7, 0, 0, 101, 0, 0, 0, 0, 0, 0, 0, 0, 211, 13, 41, 151, 61, 17, 181, 19, 23, 0, 0, 0, 227, 0, 29, 43, 53, 0, 37, 83, 0, 0, 0, 47, 0, 499, 0, 557, 0, 59, 67, 0, 0, 787, 79, 89, 1021, 103, 401, 5101, 601, 701, 8101, 109, 2003, 0, 0, 0, 2027, 0, 2029, 4003, 503
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
There are no primes that consist of copies of the digit 4, or 6, or 8, or 9, or {0,2}, or {0,3}, etc.
|
|
CROSSREFS
|
Cf. A099651, A099756, A016112.
Sequence in context: A010190 A087774 A040118 this_sequence A070277 A109864 A099756
Adjacent sequences: A099265 A099266 A099267 this_sequence A099269 A099270 A099271
|
|
KEYWORD
|
base,nonn,easy,fini
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 16 2004
|
|
|
Search completed in 0.002 seconds
|
