%I #59 Feb 13 2024 06:57:19
%S 23,37,53,73,113,131,137,173,179,197,311,317,431,617,719,1013,1031,
%T 1097,1499,1997,2239,2293,3137,4019,4919,6173,7019,7433,9677,10193,
%U 10613,11093,19973,23833,26833,30011,37019,40013,47933,73331,74177
%N Primes remaining prime if any digit is deleted (zeros allowed).
%C These might be called "super-prime numbers". - Jaime Gutierrez (jgutierrez(AT)matematicas.net), Sep 27 2007
%C A proper subset of A034895. - _Robert G. Wilson v_, Oct 12 2014
%C The largest known number in this sequence is a 274-digit prime consisting of 163 4s, followed by 80 0s, followed by 31 1s. See the CodeGolf link. - _Dmitry Kamenetsky_, Feb 26 2021
%H Giovanni Resta, <a href="/A051362/b051362.txt">Table of n, a(n) for n = 1..201</a> (terms < 10^13; first 100 terms from T. D. Noe)
%H CodeGolf StackExchange, <a href="https://codegolf.stackexchange.com/questions/10739/find-largest-prime-which-is-still-a-prime-after-digit-deletion">Find largest prime which is still a prime after digit deletion</a>, 2013.
%H Mathematics StackExchange, <a href="http://math.stackexchange.com/questions/33094">Deleting any digit yields a prime</a>, 2011.
%H Mathematics StackExchange, <a href="https://math.stackexchange.com/questions/4038896/largest-prime-that-remains-prime-when-any-one-of-its-digits-is-deleted">Largest prime that remains prime when any one of its digits is deleted</a>, 2021.
%t rpQ[n_]:=Module[{idn=IntegerDigits[n]},And@@PrimeQ[FromDigits/@ Subsets[ IntegerDigits[ n],{Length[idn]-1}]]]; Select[Prime[Range[40000]], rpQ]
%t prpQ[n_]:=AllTrue[FromDigits/@Table[Delete[IntegerDigits[n],d],{d,IntegerLength[ n]}],PrimeQ]; Select[Prime[Range[7500]],prpQ] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Nov 27 2020 *)
%o (Haskell)
%o import Data.List (inits, tails)
%o a051362 n = a051362_list !! (n-1)
%o a051362_list = filter p $ drop 4 a000040_list where
%o p x = all (== 1) $ map (a010051 . read) $
%o zipWith (++) (inits $ show x) (tail $ tails $ show x)
%o -- _Reinhard Zumkeller_, Dec 17 2011, Aug 24 2011
%o (PARI) is(n)=my(v=Vec(Str(n)),k);for(i=1, #v, k=eval(concat(vecextract(v, 2^#v-1-2^(i-1))));if(!isprime(k),return(0)));isprime(n) \\ _Charles R Greathouse IV_, Oct 05 2011
%o (Sage)
%o def is_A051362(n):
%o prime = is_prime(n)
%o if prime:
%o L = ZZ(n).digits(10)
%o for k in range(len(L)):
%o K = L[:]; del K[k]
%o prime = is_prime(ZZ(K, base=10))
%o if not prime: break
%o return prime
%o A051362_list = lambda n: filter(is_A051362, range(n))
%o A051362_list(77777) # _Peter Luschny_, Jul 17 2014
%o (Python)
%o from sympy import isprime
%o def ok(n):
%o if n < 10 or not isprime(n): return False
%o s = str(n)
%o return all(isprime(int(s[:i]+s[i+1:])) for i in range(len(s)))
%o print([k for k in range(10**5) if ok(k)]) # _Michael S. Branicky_, Nov 02 2023
%Y Cf. A034302, A010051, A000040, A034895.
%K nonn,base,nice
%O 1,1
%A _Harvey P. Dale_, May 31 2000