%I A144714
%S A144714 103,107,307,503,607,907,1013,1097,1103,1307,1607,1907,2003,2017,2053,
%T A144714 2083,2503,3023,3037,3067,3083,3307,3607,3907,4003,4007,4013,4073,5003,
%U A144714 5023,5107,5503,6007,6037,6043,6047,6053,6067,6073,6607,6907,7013,7043
%N A144714 Left-truncatable primes that contain one or more zero digits.
%C A144714 These are the terms in sequence A033664 that are not in A024785. This 
               sequence is infinitely long.
%D A144714 Angell, I. O. and Godwin, H. J. "On Truncatable Primes." Math. Comput. 
               31, 265-267, 1977.
%H A144714 H. J. Smith, <a href="b144714.txt">Table of n, a(n) for n = 1..10000</
               a>
%H A144714 H. J. Smith, <a href="http://harry-j-smith.com/hjsmithh/download.html#Left-Tru">
               Link to programs to generate truncatable primes.</a>
%H A144714 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               TruncatablePrime.html">Link to a section of The World of Mathematics.</
               a>
%H A144714 <a href="Sindx_Tri.html#tprime">Index entries for sequences related to 
               truncatable primes</a>
%o A144714 (PARI) zeroin(z)={until(z==0,q=z\10;r=z-10*q;if(r==0,return(1));z=q;);
               return(0);}
%o A144714 {fileO="b144714.txt";v=vector(15000);v[1]=2;v[2]=3;v[3]=5;v[4]=7;j=4;
               m=0;
%o A144714 p10=1;until(0,p10*=10;j0=j;for(k=1,9,k10=k*p10;for(i=1,j0,z=k10+v[i];
%o A144714 if(isprime(z),j++;v[j]=z;if(zeroin(z),m++;
%o A144714 write(fileO,m," ",z);if(m==10000,break(3));)))));}
%Y A144714 Cf. A020994, A024770, A024785, A033664, A132394.
%Y A144714 Sequence in context: A161402 A165294 A046076 this_sequence A140817 A066131 
               A095639
%Y A144714 Adjacent sequences: A144711 A144712 A144713 this_sequence A144715 A144716 
               A144717
%K A144714 nonn
%O A144714 1,1
%A A144714 Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 08 2008