This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A062351 #27 Apr 26 2021 20:48:59
%S A062351 2,3,5,7,11,131,151,181,191,353,373,383,787,797,12421,12721,12821,
%T A062351 13831,13931,14741,17971,34543,34843,35753,1235321,1245421,1257521,
%U A062351 1268621,1278721,1456541,1469641,1489841,1579751,1589851,3479743
%N A062351 Palindromic primes with strictly increasing digits up to the middle and then strictly decreasing.
%C A062351 The last term of the finite series is a(63) = 123467898764321.
%H A062351 Nathaniel Johnston, <a href="/A062351/b062351.txt">Table of n, a(n) for n = 1..63</a> (complete sequence)
%H A062351 Patrick De Geest, <a href="http://www.worldofnumbers.com/palpri.htm">World of Palindromic Primes</a>
%e A062351 13831 belongs to the sequence as it is a palindromic prime in which the digits are increasing up to the middle digit 8 and then decreasing.
%o A062351 (Python)
%o A062351 from sympy import isprime
%o A062351 from itertools import combinations
%o A062351 def agen():
%o A062351 for digits in range(1, 19):
%o A062351 for left in combinations("123456789", (digits+1)//2):
%o A062351 left = "".join(left)
%o A062351 yield int(left + (left[:digits//2])[::-1])
%o A062351 print(list(filter(isprime, agen()))) # _Michael S. Branicky_, Apr 25 2021
%Y A062351 Cf. A343524 (strictly increasing palindromes), A062352, A084836.
%K A062351 nonn,base,easy,fini,full
%O A062351 1,1
%A A062351 _Amarnath Murthy_, Jun 23 2001
%E A062351 Corrected and edited by _Patrick De Geest_, Jun 07 2003