login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057883 Smallest possible prime with at least n (from 2 to 10) distinct digits that remains prime (leading zeros not allowed) when all occurrences of its digits d are deleted. 7
23, 137, 6173, 37019, 5600239, 476710937, 8192454631, 1645957688093, 78456580281239 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

LINKS

Table of n, a(n) for n=2..10.

C. Rivera, PrimePuzzle 110

C. K. Caldwell, Prime Curios! 5600239

C. K. Caldwell, Prime Curios! 476710937.

EXAMPLE

5600239 is a solution for at least 6 digits because 56239, 560039, 560029, 600239, 500239 and 560023 are all primes.

CROSSREFS

Cf. A057876-A057882, A051362, A034302-A034305.

Sequence in context: A093806 A142679 A254758 * A160221 A042024 A141999

Adjacent sequences:  A057880 A057881 A057882 * A057884 A057885 A057886

KEYWORD

nonn,base,fini,full

AUTHOR

Patrick De Geest, Oct 15 2000

EXTENSIONS

More terms from Giovanni Resta, Feb 15 2006

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 03:59 EST 2021. Contains 349530 sequences. (Running on oeis4.)