login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055521 Restricted left truncatable (Henry VIII) primes. 3

%I #27 Dec 11 2022 23:04:36

%S 773,3373,3947,4643,5113,6397,6967,7937,15647,16823,24373,33547,34337,

%T 37643,56983,57853,59743,62383,63347,63617,69337,72467,72617,75653,

%U 76367,87643,92683,97883,98317,121997,124337,163853,213613,236653

%N Restricted left truncatable (Henry VIII) primes.

%C There are 1440 such primes, the largest being 357686312646216567629137.

%C Left-truncatable primes (A024785) which have at least two digits and are not the end of a larger left-truncatable prime. - _Jens Kruse Andersen_, Jul 29 2014

%D Kahan, S. and Weintraub, S. "Left Truncatable Primes." J. Recr. Math. 29, 254-264, 1998.

%H Jens Kruse Andersen, <a href="/A055521/b055521.txt">Table of n, a(n) for n = 1..1440</a> (complete sequence)

%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 James Grime and Brady Haran, <a href="https://www.youtube.com/watch?v=azL5ehbw_24">357686312646216567629137</a>, Numberphile video (2018)

%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>

%e 773 is in the sequence since 773, 73, 3 are primes, while no digit 1..9 gives a prime if placed before 773. 13 is not in the sequence since for example 113 is prime. 2 and 5 are disqualified for only having one digit. - _Jens Kruse Andersen_, Jul 29 2014

%o (Python)

%o from sympy import isprime, primerange

%o def afull():

%o alst, prime_strs, an, digits = [], ["2", "3", "5", "7"], 0, 1

%o while len(prime_strs) > 0:

%o new_prime_strs = set()

%o for p in prime_strs:

%o can_extend = False

%o for d in "123456789":

%o c = d + p

%o if isprime(int(c)):

%o can_extend = True

%o new_prime_strs.add(c)

%o if digits > 1 and not can_extend:

%o alst.append(int(p))

%o prime_strs = new_prime_strs

%o digits += 1

%o return sorted(alst)

%o print(afull()) # _Michael S. Branicky_, Dec 11 2022

%Y Cf. A024785.

%K nonn,base,fini,full

%O 1,1

%A _Eric W. Weisstein_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 7 13:12 EDT 2024. Contains 375013 sequences. (Running on oeis4.)