The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A083438 Smallest 2n-1 digit palindromic prime with digit sum of 2n-1, or 0 if no such number exists. 2
 10301, 1201021, 0, 10000900001, 1000027200001, 0, 10000025152000001, 1000000253520000001, 0, 10000000027372000000001, 1000000000275720000000001, 0, 10000000000046764000000000001, 1000000000000297920000000000001, 0, 10000000000000066966000000000000001 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,1 COMMENTS If 2n-1 is a multiple of 3 then a(n) = 0. LINKS Chai Wah Wu, Table of n, a(n) for n = 3..68 CROSSREFS Cf. A083440, A083442. Sequence in context: A227411 A100502 A099746 * A212939 A237924 A255658 Adjacent sequences:  A083435 A083436 A083437 * A083439 A083440 A083441 KEYWORD base,nonn AUTHOR Amarnath Murthy, Apr 30 2003 EXTENSIONS Definition corrected by and a(8)-a(18) from Chai Wah Wu, Nov 06 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 10:11 EST 2021. Contains 349543 sequences. (Running on oeis4.)