|
Search: id:A069664
|
|
|
| A069664 |
|
Largest n-digit prime with minimum digit sum. |
|
+0
10
|
|
| 2, 11, 101, 3001, 21001, 102001, 2100001, 30000001, 200001001, 2010000001, 30000000001, 110000000101, 2000001000001, 20000000100001, 200000010000001, 1100010000000001, 20000001000000001, 110000000000000101
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Joel B. Lewis (jblewis(AT)post.harvard.edu), Jan 07 2008, Table of n, a(n) for n = 1..51
|
|
MATHEMATICA
|
Table[ Max[ Flatten[Table[ If[PrimeQ[10^n + 1], 10^n + 1, If[PrimeQ[10^n + 10^i + 10^j + 1], 10^n + 10^i + 10^j + 1, 0]], {i, 0, n}, {j, 0, i}]]], {n, 1, 50}] (Program works so long as there exists an n-digit prime with digit sum 4 or less).
|
|
CROSSREFS
|
Cf. A069661, A069662, A069663.
Adjacent sequences: A069661 A069662 A069663 this_sequence A069665 A069666 A069667
Sequence in context: A121419 A099701 A089393 this_sequence A130150 A115941 A024721
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 05 2002
|
|
EXTENSIONS
|
a(7) - a(12) from Tom Mueller (muel4503(AT)uni-trier.de), Apr 28 2004
a(13) and a(14) from Ray G. Opao (1260(AT)email.com), Jul 02 2007
a(13) and a(14) corrected and a(15) onwards added by Joel B. Lewis (jblewis(AT)post.harvard.edu), Jan 07 2008
|
|
|
Search completed in 0.002 seconds
|
