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 A077652 #39 Sep 03 2025 01:34:11
%S A077652 2,3,5,7,11,101,131,151,181,191,313,353,373,383,727,757,787,797,919,
%T A077652 929,1021,1031,1051,1061,1091,1151,1171,1181,1201,1231,1291,1301,1321,
%U A077652 1361,1381,1451,1471,1481,1511,1531,1571,1601,1621,1721,1741,1801,1811
%N A077652 Primes whose initial and terminal decimal digits are identical.
%C A077652 1021 is the smallest of these not to be palindromic. - _Jonathan Vos Post_, Nov 02 2013
%C A077652 All palindromic primes (A002385) except 11 have an odd number of digits, therefore all terms > 11 with an even number of digits are non-palindromic in this sequence. - _M. F. Hasler_, Nov 02 2013
%H A077652 Bruno Berselli, <a href="/A077652/b077652.txt">Table of n, a(n) for n = 1..1000</a>
%t A077652 Do[s1=First[IntegerDigits[Prime[n]]]; s2=Last[IntegerDigits[Prime[n]]]; If[Equal[s1, s2], Print[Prime[n]]], {n, 1, 1000}]
%t A077652 itdQ[n_]:=Module[{idn=IntegerDigits[n]},idn[[1]]==idn[[-1]]]; Select[Prime[ Range[ 500]], itdQ] (* _Harvey P. Dale_, Apr 12 2013 *)
%o A077652 (Magma) [ p: p in PrimesUpTo(2000) | P[#P] eq P[1] where P is Intseq(p) ]; // _Bruno Berselli_, Jul 26 2011
%o A077652 (PARI) is(n)=digits(n)[1]==n%10&&isprime(n) \\ _M. F. Hasler_, Nov 02 2013
%Y A077652 Cf. A000030, A000040, A002385, A227858.
%K A077652 base,nonn,changed
%O A077652 1,1
%A A077652 _Labos Elemer_, Nov 19 2002