|
| |
|
|
A036937
|
|
Smallest n-digit prime containing only digits 2 and 3.
|
|
4
| |
|
|
2, 23, 223, 2333, 23333, 222323, 2222333, 22222223, 222323333, 2222232323, 22222222223, 222222333323, 2222222222323, 22222222223323, 222222222332233, 2222222222323223, 22222222222233323, 222222222222233323
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| It is conjectured that a(n) always exists.
|
|
|
LINKS
| Robert G. Wilson v, Comments and first 121 terms
|
|
|
MATHEMATICA
| Do[p = 2(10^n - 1)/9; k = 0; While[ ! PrimeQ[p], k++; p = FromDigits[ PadLeft[ IntegerDigits[k, 2], n] + 2]]; Print[p], {n, 1, 30}]
|
|
|
CROSSREFS
| Cf. A036229, A020458, A036310, A069841.
Sequence in context: A069837 A069629 A069614 * A083808 A037750 A037631
Adjacent sequences: A036934 A036935 A036936 * A036938 A036939 A036940
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Patrick De Geest (pdg(AT)worldofnumbers.com), Jan 04 1999.
|
|
|
EXTENSIONS
| Mathematica program from Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 20 2002
|
| |
|
|
