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 A132394 #22 Apr 22 2018 04:48:57
%S A132394 2,3,5,7,13,23,43,53,73,83,17,37,47,67,97,113,313,613,223,523,823,443,
%T A132394 643,743,353,653,853,953,173,373,673,773,283,383,683,883,983,317,617,
%U A132394 137,337,937,347,547,647,947,167,367,467,967,197,397,797,997,2113
%N A132394 Left-truncatable primes in the order generated (with no zero digits).
%C A132394 The most logical way of generating the Left-truncatable primes generates them in this order. Last term is a(4260)=357686312646216567629137.
%H A132394 H. J. Smith, <a href="/A132394/b132394.txt">Table of n, a(n) for n = 1..4260</a> (full sequence)
%H A132394 I. O. Angell and H. J. Godwin, <a href="http://dx.doi.org/10.1090/S0025-5718-1977-0427213-2">On Truncatable Primes</a>, Math. Comput. 31, 265-267, 1977.
%H A132394 H. J. Smith, <a href="http://harry-j-smith-memorial.com/download.html#Left-Tru">Link to program to generate this sequence and its output file.</a>
%H A132394 <a href="/index/Tri#tprime">Index entries for sequences related to truncatable primes</a>
%o A132394 (PARI) {fileO="b132394.txt";v=vector(4260);v[1]=2;v[2]=3;v[3]=5;v[4]=7;i=0;j=4; write(fileO,"1 2");write(fileO,"2 3");write(fileO,"3 5");write(fileO,"4 7"); until(i>=j,i++;p=v[i];P10=10^(1+log(p)\log(10)); for(k=1,9,z=k*P10+p;if(isprime(z),j++;v[j]=z;write(fileO,j," ",z);)));} \\ _Harry J. Smith_, Sep 18 2008
%Y A132394 Cf. A024785.
%K A132394 base,fini,full,nonn
%O A132394 1,1
%A A132394 _Harry J. Smith_, Nov 11 2007
%E A132394 Edited by _Jason G. Wurtzel_, Oct 06 2010