This site is supported by donations to The OEIS Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131306 Smallest prime ending with exactly n identical digits. 1


%S 2,11,1777,23333,199999,2999999,19999999,577777777,1777777777,

%T 23333333333,311111111111,2111111111111,17777777777777,

%U 499999999999999,1333333333333333,23333333333333333

%N Smallest prime ending with exactly n identical digits.

%C By Dirichlet's theorem, there is a prime for each n. For the n in A004023, the smallest prime consists of all ones. - T. D. Noe, Oct 01 2007

%H T. D. Noe, <a href="/A131306/b131306.txt">Table of n, a(n) for n=1..200</a>

%e a(4)=23333 because 23333 is the smallest prime ending with exactly 4 identical digits.

%t sp[n_]:=Module[{k=1},While[!PrimeQ[k*10^IntegerLength[n]+n],k++];k*10^IntegerLength[n]+n]; Join[{2,11},Table[Min[sp/@FromDigits/@ Table[PadRight[{},i,n],{n,{1,3,7,9}}]],{i,3,20}]] (* _Harvey P. Dale_, Aug 28 2016 *)

%K base,nonn

%O 1,1

%A _Shyam Sunder Gupta_, Sep 29 2007

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 July 17 14:39 EDT 2019. Contains 325106 sequences. (Running on oeis4.)