1,1

Every palindrome with an even number of digits is divisible by 11, so 11 is the only member of the sequence with an even number of digits. - David Wasserman (wasserma(AT)spawar.navy.mil), Sep 09 2004

A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 228.

Attila Olah, Table of n, a(n) for n=1..100197

K. S. Brown, On General Palindromic Numbers

P. De Geest, World!Of Palindromic Primes

I. Peterson, Math Trek, Palindromic Primes

M. Shafer, First 401066 Palprimes [Broken link]

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

Eric Weisstein's World of Mathematics, Integer Sequence Primes

Wikipedia, Palindromic prime

ff := proc(n) local i, j, k, s, aa, nn, bb, flag; s := n; aa := convert(s, string); nn := length(aa); bb := ``; for i from nn by -1 to 1 do bb := cat(bb, substring(aa, i..i)); od; flag := 0; for j from 1 to nn do if substring(aa, j..j)<>substring(bb, j..j) then flag := 1 fi; od; RETURN(flag); end; gg := proc(i) if ff(ithprime(i)) = 0 then RETURN(ithprime(i)) fi end;

rev:=proc(n) local nn, nnn: nn:=convert(n, base, 10): add(nn[nops(nn)+1-j]*10^(j-1), j=1..nops(nn)) end: a:=proc(n) if n=rev(n) and isprime(n)=true then n else fi end: seq(a(n), n=1..20000); # rev is a Maple program to revert a number - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 25 2007

Select[ Prime[ Range[ 2100 ] ], IntegerDigits[ # ] == Reverse[ IntegerDigits[ # ] ] & ]

Cf. A016041, A029732, A117697.

Adjacent sequences: A002382 A002383 A002384 this_sequence A002386 A002387 A002388

Sequence in context: A052480 A083137 A077652 this_sequence A069217 A083139 A088562

nonn,base,nice,easy

njas, Simon Plouffe (plouffe(AT)math.uqam.ca)

More terms from Larry Reeves (larryr(AT)acm.org), Oct 25 2000