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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A259152 a(n) = smallest n-digit prime with first 10 digits distinct. 1
 10234567897, 102345678907, 1023456789013, 10234567890077, 102345678900007, 1023456789000073, 10234567890000053, 102345678900000059, 1023456789000000049, 10234567890000000007 (list; graph; refs; listen; history; text; internal format)
 OFFSET 11,1 COMMENTS There is no 10-digit prime with the first 10 digits distinct, hence offset=11. LINKS Robert Israel, Table of n, a(n) for n = 11..900 MAPLE seq(nextprime(1023456789*10^(d-10)), d=11..100); # Robert Israel, Jun 19 2015 MATHEMATICA Table[NextPrime[1023456789*10^(d - 10)], {d, 11, 100}] (* Michael De Vlieger, Jun 19 2015, after the Maple by Robert Israel *) PROG (Perl) use Math::GMPz; use ntheory ":all"; do { my \$n=next_prime(1023456789 * Math::GMPz->new(10)**(\$_-10)); say \$n; } for (11..100); # Dana Jacobsen, Jun 26 2015 CROSSREFS Cf. A000040, A007810, A029743, A259146. Sequence in context: A144648 A098143 A276590 * A135047 A017541 A112453 Adjacent sequences:  A259149 A259150 A259151 * A259153 A259154 A259155 KEYWORD nonn,base AUTHOR Zak Seidov, Jun 19 2015 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.

Last modified August 6 10:14 EDT 2020. Contains 336245 sequences. (Running on oeis4.)