login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Smallest 2n-1 digit palindromic prime with digit sum of 2n-1, or 0 if no such number exists.
2

%I #11 Nov 07 2015 08:55:00

%S 10301,1201021,0,10000900001,1000027200001,0,10000025152000001,

%T 1000000253520000001,0,10000000027372000000001,

%U 1000000000275720000000001,0,10000000000046764000000000001,1000000000000297920000000000001,0,10000000000000066966000000000000001

%N Smallest 2n-1 digit palindromic prime with digit sum of 2n-1, or 0 if no such number exists.

%C If 2n-1 is a multiple of 3 then a(n) = 0.

%H Chai Wah Wu, <a href="/A083438/b083438.txt">Table of n, a(n) for n = 3..68</a>

%Y Cf. A083440, A083442.

%K base,nonn

%O 3,1

%A _Amarnath Murthy_, Apr 30 2003

%E Definition corrected by and a(8)-a(18) from _Chai Wah Wu_, Nov 06 2015