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 A062352 #14 Aug 04 2022 15:04:30
%S A062352 2,3,5,7,11,101,313,727,757,919,929,31013,73037,73237,74047,76367,
%T A062352 91019,93139,93239,94049,94349,96269,96469,97379,97579,98389,98689,
%U A062352 7310137,7521257,7540457,7630367,7632367,7654567,9320239,9610169
%N A062352 Palindromic primes with strictly decreasing digits up to the middle and then strictly increasing.
%C A062352 The last term of this finite series is 97654321012345679.
%C A062352 There are 84 terms. - _Michael S. Branicky_, Aug 04 2022
%H A062352 Michael S. Branicky, <a href="/A062352/b062352.txt">Table of n, a(n) for n = 1..84</a> (full sequence)
%H A062352 Patrick De Geest, <a href="http://www.worldofnumbers.com/palpri.htm">World of Palindromic Primes</a>
%e A062352 31013 belongs to the sequence as it is a palindromic prime in which the digits are decreasing up to the middle digit 0 and then increasing.
%o A062352 (Python)
%o A062352 from sympy import isprime
%o A062352 from itertools import combinations
%o A062352 def bgen():
%o A062352 for digits in range(1, 20):
%o A062352 for left in combinations("9876543210", (digits+1)//2):
%o A062352 left = "".join(left)
%o A062352 yield int(left + (left[:digits//2])[::-1])
%o A062352 afull = sorted(filter(isprime, bgen()))
%o A062352 print(afull) # _Michael S. Branicky_, Aug 04 2022
%Y A062352 Cf. A062351.
%K A062352 nonn,base,fini,full
%O A062352 1,1
%A A062352 _Amarnath Murthy_, Jun 23 2001
%E A062352 Corrected and edited by _Patrick De Geest_, Jun 07 2003