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 A210498 #20 Jul 26 2022 22:00:33
%S A210498 131,137,139,173,179,311,313,317,373,379,719,733,739,797,971,977,1493,
%T A210498 1499,1571,1579,1993,1997,1999,3119,3371,3373,3593,7013,7019,7331,
%U A210498 7333,7393,7433,7517,7691,7699,9371,9377,9413,9419,9533,9539,9677,9679,9719,9833
%N A210498 Prime numbers that become emirps when their least-significant-digit is deleted.
%C A210498 This sequence (like the emirps) experiences large gaps when the most-significant-digit is {2,4,5,6,8}.
%H A210498 Christian N. K. Anderson, <a href="/A210498/b210498.txt">Table of n, a(n) for n = 1..10000</a>
%e A210498 Example: a(1)=131, which becomes 13 upon deletion, which is an emirp.
%o A210498 (R) library(gmp); isemirp<-function(x) isprime(x) & (j=paste(rev(unlist(strsplit(as.character(x),split=""))),collapse=""))!=x & isprime(j);i=as.bigz(0); y=as.bigz(rep(0,100)); len=0;
%o A210498 while(len<100)
%o A210498 if(isprime((i=nextprime(i))))
%o A210498 if(isemirp(as.bigz(substr(i,1,nchar(as.character(i))-1))))
%o A210498 y[(len=len+1)]=i
%Y A210498 Cf. A006567, A024770, A000040, A225235
%K A210498 nonn,base
%O A210498 1,1
%A A210498 _Kevin L. Schwartz_ and _Christian N. K. Anderson_, May 03 2013