Search: id:A002385 Results 1-1 of 1 results found. %I A002385 M0670 N0247 %S A002385 2,3,5,7,11,101,131,151,181,191,313,353,373,383,727,757,787,797,919, %T A002385 929,10301,10501,10601,11311,11411,12421,12721,12821,13331,13831,13931, %U A002385 14341,14741,15451,15551,16061,16361,16561,16661,17471,17971,18181 %N A002385 Palindromic primes: prime numbers whose decimal expansion is a palindrome. %C A002385 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 %D A002385 A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 228. %D A002385 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A002385 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A002385 Attila Olah, Table of n, a(n) for n=1..100197 %H A002385 K. S. Brown, On General Palindromic Numbers %H A002385 P. De Geest, World!Of Palindromic Primes %H A002385 I. Peterson, Math Trek, Palindromic Primes %H A002385 M. Shafer, First 401066 Palprimes [Broken link] %H A002385 Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics. %H A002385 Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics. %H A002385 Eric Weisstein's World of Mathematics, Integer Sequence Primes %H A002385 Wikipedia, Palindromic prime %p A002385 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; %p A002385 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 %t A002385 Select[ Prime[ Range[ 2100 ] ], IntegerDigits[ # ] == Reverse[ IntegerDigits[ # ] ] & ] %Y A002385 A007500 = this sequence union A006567. %Y A002385 Cf. A016041, A029732, A117697. %Y A002385 Sequence in context: A052480 A083137 A077652 this_sequence A069217 A083139 A088562 %Y A002385 Adjacent sequences: A002382 A002383 A002384 this_sequence A002386 A002387 A002388 %K A002385 nonn,base,nice,easy %O A002385 1,1 %A A002385 N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com) %E A002385 More terms from Larry Reeves (larryr(AT)acm.org), Oct 25 2000 Search completed in 0.002 seconds