|
| |
|
|
A132394
|
|
Left-truncatable primes in the order generated (with no zero digits).
|
|
2
| |
|
|
2, 3, 5, 7, 13, 23, 43, 53, 73, 83, 17, 37, 47, 67, 97, 113, 313, 613, 223, 523, 823, 443, 643, 743, 353, 653, 853, 953, 173, 373, 673, 773, 283, 383, 683, 883, 983, 317, 617, 137, 337, 937, 347, 547, 647, 947, 167, 367, 467, 967, 197, 397, 797, 997, 2113
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The most logical way of generating the Left-truncatable primes generates them in this order. Last term is a(4260)=357686312646216567629137.
|
|
|
REFERENCES
| Angell, I. O. and Godwin, H. J. "On Truncatable Primes." Math. Comput. 31, 265-267, 1977.
|
|
|
LINKS
| H. J. Smith, Table of n, a(n) for n = 1..4260
Index entries for sequences related to truncatable primes
H. J. Smith, Link to program to generate this sequence and its output file.
|
|
|
PROG
| (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); ))); } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 18 2008]
|
|
|
CROSSREFS
| Cf. A024785.
Sequence in context: A064336 A179921 A126092 * A006992 A185231 A080190
Adjacent sequences: A132391 A132392 A132393 * A132395 A132396 A132397
|
|
|
KEYWORD
| base,fini,nonn
|
|
|
AUTHOR
| Harry J. Smith (hjsmithh(AT)sbcglobal.net), Nov 11 2007
|
|
|
EXTENSIONS
| Edited by Jason G. Wurtzel (j_seq(AT)wurtzel.com), Oct 06 2010
|
| |
|
|
