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!)
A259152 a(n) = smallest n-digit prime with first 10 digits distinct. 1

%I #23 Jun 27 2015 07:35:40

%S 10234567897,102345678907,1023456789013,10234567890077,

%T 102345678900007,1023456789000073,10234567890000053,

%U 102345678900000059,1023456789000000049,10234567890000000007

%N a(n) = smallest n-digit prime with first 10 digits distinct.

%C There is no 10-digit prime with the first 10 digits distinct, hence offset=11.

%H Robert Israel, <a href="/A259152/b259152.txt">Table of n, a(n) for n = 11..900</a>

%p seq(nextprime(1023456789*10^(d-10)),d=11..100); # _Robert Israel_, Jun 19 2015

%t Table[NextPrime[1023456789*10^(d - 10)], {d, 11, 100}] (* _Michael De Vlieger_, Jun 19 2015, after the Maple by _Robert Israel_ *)

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

%Y Cf. A000040, A007810, A029743, A259146.

%K nonn,base

%O 11,1

%A _Zak Seidov_, Jun 19 2015

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 April 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)