|
|
A028989
|
|
Smallest palindromic prime with 2n-1 digits.
|
|
6
|
|
|
2, 101, 10301, 1003001, 100030001, 10000500001, 1000008000001, 100000323000001, 10000000500000001, 1000000008000000001, 100000000212000000001, 10000000000300000000001
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MATHEMATICA
|
t={}; Do[p=NextPrime[10^(2*n)]; While[Reverse[x=IntegerDigits[p]]!=x, p=NextPrime[p]]; AppendTo[t, p], {n, 0, 6}]; t (* Jayanta Basu, Jun 05 2013 *)
|
|
PROG
|
(PARI) a(n)={
n--;
my(N=100^n+1, aS=10^(n+3)+10^(n-3), bS=10^(n+2)+10^(n-2), cS=10^(n+1)+10^(n-1), dS=10^n);
forstep(a=N, N+9*aS, aS,
forstep(b=a, a+9*bS, bS,
forstep(c=b, b+9*cS, cS,
forstep(d=c, c+9*dS, dS,
if(ispseudoprime(d), return(d))
))));
warning("could not find a("n")")
(PARI) a(n)=for(j=10^(n-1), 10^n-1, d=digits(j); p=fromdigits(vector(2*n-1, x, if(x<n, d[x], d[2*n-x]))); ispseudoprime(p)&&return(p)); 0 \\ Jeppe Stig Nielsen, Feb 20 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|