cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A259152 #23 Jun 27 2015 07:35:40
%S A259152 10234567897,102345678907,1023456789013,10234567890077,
%T A259152 102345678900007,1023456789000073,10234567890000053,
%U A259152 102345678900000059,1023456789000000049,10234567890000000007
%N A259152 a(n) = smallest n-digit prime with first 10 digits distinct.
%C A259152 There is no 10-digit prime with the first 10 digits distinct, hence offset=11.
%H A259152 Robert Israel, <a href="/A259152/b259152.txt">Table of n, a(n) for n = 11..900</a>
%p A259152 seq(nextprime(1023456789*10^(d-10)),d=11..100); # _Robert Israel_, Jun 19 2015
%t A259152 Table[NextPrime[1023456789*10^(d - 10)], {d, 11, 100}] (* _Michael De Vlieger_, Jun 19 2015, after the Maple by _Robert Israel_ *)
%o A259152 (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 A259152 Cf. A000040, A007810, A029743, A259146.
%K A259152 nonn,base
%O A259152 11,1
%A A259152 _Zak Seidov_, Jun 19 2015