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”).

A056732
Smallest palindromic prime using n digits, or 0 if no such number exists.
2
2, 11, 101, 0, 10301, 0, 1003001, 0, 100030001, 0, 10000500001, 0, 1000008000001, 0, 100000323000001, 0, 10000000500000001, 0, 1000000008000000001, 0, 100000000212000000001, 0, 10000000000300000000001, 0, 1000000000016100000000001, 0
OFFSET
1,1
FORMULA
a(2*n) = 0 for n >= 2 (palindromes of even length are divisible by 11). - Joerg Arndt, May 01 2022
MATHEMATICA
Do[ k = 10^n; While[ ! PrimeQ[ k*10^n + FromDigits[ Take[ Reverse[ RealDigits[ k ][ [ 1 ] ] ], {2, -1} ] ] ], k++ ]; Print[ k*10^n + FromDigits[ Take[ Reverse[ RealDigits[ k ][ [ 1 ] ] ], {2, -1} ] ] ]; If[ n == 0, Print[ 11 ], Print[ 0 ] ], {n, 0, 12} ]
CROSSREFS
Odd-numbered terms form A028989. - Edward Catmur, May 01 2015
Sequence in context: A220433 A318007 A243950 * A157715 A001271 A038371
KEYWORD
nonn,base
AUTHOR
Robert G. Wilson v, Aug 11 2000
EXTENSIONS
a(25)-a(26) from Michael S. Branicky, Feb 12 2021
Name corrected by Joerg Arndt, May 01 2022
STATUS
approved