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, 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

Offset

1,2

Links

Table of n, a(n) for n=1..72.

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: A087774 A322562 A040118 * A070277 A109864 A231433

Adjacent sequences: A099265 A099266 A099267 * A099269 A099270 A099271

Keyword

base,nonn,easy,fini

Author

Robert G. Wilson v, Nov 16 2004

Status

approved