|
Search: id:A099651
|
|
|
| A099651 |
|
For each of the C(10,2) = 45 pairs of decimal digits, record the smallest prime containing only these digits (if one exists); sort. |
|
+0
7
|
|
| 13, 17, 19, 23, 29, 37, 41, 43, 47, 53, 59, 61, 67, 79, 83, 89, 101, 151, 181, 211, 227, 449, 557, 787
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The sequence consists of 24 terms, of which 16 cases < 100.
From 45 combinations of 10 decimal digits only 24 can be prime. All least cases are here.
|
|
EXAMPLE
|
Primes with digits of 8 and 9 are in A020472:{89,8999,89899,89989..}. The smallest = 89 is here.
|
|
CROSSREFS
|
Cf. A020449-A020472, A099756.
Adjacent sequences: A099648 A099649 A099650 this_sequence A099652 A099653 A099654
Sequence in context: A045921 A040136 A049482 this_sequence A105878 A054476 A099184
|
|
KEYWORD
|
base,fini,full,nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Nov 11 2004
|
|
|
Search completed in 0.002 seconds
|
