|
%I #13 Apr 22 2018 04:49:01
%S 103,107,307,503,607,907,1013,1097,1103,1307,1607,1907,2003,2017,2053,
%T 2083,2503,3023,3037,3067,3083,3307,3607,3907,4003,4007,4013,4073,
%U 5003,5023,5107,5503,6007,6037,6043,6047,6053,6067,6073,6607,6907,7013,7043
%N Left-truncatable primes that contain one or more zero digits.
%C These are the terms in sequence A033664 that are not in A024785. This sequence is infinitely long.
%H H. J. Smith, <a href="/A144714/b144714.txt">Table of n, a(n) for n = 1..10000</a>
%H 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 H. J. Smith, <a href="http://harry-j-smith-memorial.com/download.html#Left-Tru">Link to programs to generate truncatable primes.</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/TruncatablePrime.html">Truncatable Prime</a>
%H <a href="/index/Tri#tprime">Index entries for sequences related to truncatable primes</a>
%o (PARI) zeroin(z)={until(z==0,q=z\10;r=z-10*q;if(r==0,return(1));z=q;);return(0);}
%o {fileO="b144714.txt";v=vector(15000);v[1]=2;v[2]=3;v[3]=5;v[4]=7;j=4;m=0;
%o p10=1;until(0,p10*=10;j0=j;for(k=1,9,k10=k*p10;for(i=1,j0,z=k10+v[i];
%o if(isprime(z),j++;v[j]=z;if(zeroin(z),m++;
%o write(fileO,m," ",z);if(m==10000,break(3));)))));}
%Y Cf. A020994, A024770, A024785, A033664, A132394.
%K nonn,base
%O 1,1
%A _Harry J. Smith_, Oct 08 2008
|
