This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A029976 Palindromic primes in base 8. 9
 2, 3, 5, 7, 73, 89, 97, 113, 211, 227, 251, 349, 373, 463, 479, 487, 503, 4289, 4481, 4937, 5393, 5521, 5657, 5849, 6761, 7537, 7993, 12547, 12611, 12739, 13003, 13259, 13331, 13523, 14107, 14563, 14627, 14891, 15083, 15667, 15731, 15859 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Chai Wah Wu, Table of n, a(n) for n = 1..15000 Patrick De Geest, World!Of Palindromic Primes MATHEMATICA palQ[n_, b_:10] := Module[{idn = IntegerDigits[n, b]}, idn == Reverse[idn]]; Select[Prime[Range[2000]], palQ[#, 8] &] (* Harvey P. Dale, Dec 23 2013 *) PROG (Python) from itertools import chain from sympy import isprime from gmpy2 import digits A029976 = sorted((n for n in chain((int(digits(x, 8)+digits(x, 8)[::-1], 8) for x in range(1, 8**6)), (int(digits(x, 8)+digits(x, 8)[-2::-1], 8) for x in range(1, 8**6))) if isprime(n))) # Chai Wah Wu, Aug 16 2014 (PARI) forprime(p=2, 10^4, my(d=digits(p, 8)); if(d==Vecrev(d), print1(p, ", "))); \\ Joerg Arndt, Aug 17 2014 CROSSREFS Cf. A006341. Sequence in context: A241723 A090717 A090715 * A074310 A264576 A070275 Adjacent sequences:  A029973 A029974 A029975 * A029977 A029978 A029979 KEYWORD nonn,base AUTHOR 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 19 08:25 EST 2018. Contains 318245 sequences. (Running on oeis4.)