The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #16 Jul 25 2017 06:59:52
%S 2,11,101,3001,21001,102001,2100001,30000001,200001001,2010000001,
%T 30000000001,110000000101,2000001000001,20000000100001,
%U 200000010000001,1100010000000001,20000001000000001,110000000000000101,2000000000000100001,20000000100000000001
%N Largest n-digit prime with minimum digit sum.
%H Joel B. Lewis and T. D. Noe, <a href="/A069664/b069664.txt">Table of n, a(n) for n = 1..100</a>
%t 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).
%Y Cf. A069661, A069662, A069663.
%K nonn,base
%O 1,1
%A _Amarnath Murthy_, Apr 05 2002
%E a(7)-a(12) from _Tom Mueller_, Apr 28 2004
%E a(13) and onwards added by _Joel B. Lewis_, Jan 07 2008