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 A032597 #19 Aug 11 2024 14:41:30 %S A032597 1880881,1881881,1970791,3591953,7821287,108505801,159202951, %T A032597 160717061,175111571,187111781,316707613,319414913,725606527, %U A032597 728909827,731919137,904101409,921212129,930515039,987212789,987505789,10457075401,10745154701 %N A032597 Third of three consecutive palindromes all of which are prime. %H A032597 Charles R Greathouse IV, <a href="/A032597/b032597.txt">Table of n, a(n) for n = 1..10000</a> %H A032597 P. De Geest, <a href="https://www.worldofnumbers.com/palpri.htm">World!Of Palindromic Primes</a> %o A032597 (PARI) nxt(n)=my(d=digits(n)); i=(#d+1)\2; while(i&&d[i]==9, d[i]=0; d[#d+1-i]=0; i--); if(i, d[i]++; d[#d+1-i]=d[i], d=vector(#d+1); d[1]=d[#d]=1); sum(i=1, #d, 10^(#d-i)*d[i]) \\ From _David A. Corneth_ at A002113 %o A032597 list(lim)=my(v=List(),p=1,q=2,r=3); while(r<=lim\=1, if(isprime(r), if(isprime(q), if(isprime(p), listput(v,r)); p=q; q=r; r=nxt(r), q=nxt(p=r); r=nxt(q)), q=nxt(p=nxt(r)); r=nxt(q))); Vec(v) \\ _Charles R Greathouse IV_, Aug 11 2021 %Y A032597 Cf. A002385, A032595, A032596. %K A032597 nonn,base %O A032597 1,1 %A A032597 _Patrick De Geest_, May 15 1998 %E A032597 New name from _Charles R Greathouse IV_, Aug 11 2021