login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185267 Smallest palindrome beginning with n-th prime. 1
2, 3, 5, 7, 11, 131, 171, 191, 232, 292, 313, 373, 414, 434, 474, 535, 595, 616, 676, 717, 737, 797, 838, 898, 979, 101, 10301, 10701, 10901, 11311, 12721, 131, 13731, 13931, 14941, 151, 15751, 16361, 16761, 17371, 17971, 181, 191, 19391, 19791, 1991, 2112, 22322 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n) is itself prime for n = 1, 2, 3, 4, 5, 6, 8, 11, 12, 22, 26, 27, 30, 31, 32, 34, ... where a(n) = 2, 3, 5, 7, 11, 131, 191, 313, 373, 797, 101, 10301, 11311, 12721, 131, 13931, which are also in A002385. Although 979 begins with the prime p(25) = 97, and is a palindrome, it is not in the commented subsequence because 979 = 11 * 89 is semiprime rather than prime.
LINKS
FORMULA
a(n) = A082216(A000040(n)).
EXAMPLE
a(6) = 131 because that is the smallest palindrome beginning (base 10) with p(6) = 13.
PROG
(Python)
from sympy import prime
def A185267(n):
p = prime(n)
s = str(p)
if s == s[::-1]:
return p
for i in range(1, len(s)):
if s[i:] == s[-1:i-1:-1]:
return int(s+s[i-1::-1]) # Chai Wah Wu, Aug 27 2021
CROSSREFS
Sequence in context: A070028 A084836 A062351 * A088249 A241724 A186449
KEYWORD
nonn,base,easy
AUTHOR
Jonathan Vos Post, Feb 19 2011
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 6 08:50 EDT 2024. Contains 372292 sequences. (Running on oeis4.)