|
| |
|
|
A069569
|
|
a(n) = smallest prime that can be written in base 10 using just n n's.
|
|
2
| |
|
|
2, 13, 223, 2333, 44449, 555557, 16666669, 77767777, 888888883, 9199999999, 1011010101010101010109, 11111111111111111111117, 12112121212121212121212127, 131131313131313131313131313
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| For n > 9 the smallest prime obtained by inserting digits between the n's.
|
|
|
EXAMPLE
| The smallest prime containing no 0's is 2, so a(0) = 2.
|
|
|
CROSSREFS
| Sequence in context: A193550 A102585 A078702 * A015196 A187648 A113098
Adjacent sequences: A069566 A069567 A069568 * A069570 A069571 A069572
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 24 2002
|
|
|
EXTENSIONS
| Edited, corrected and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Mar 27 2002
|
| |
|
|
