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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069569 a(n) = smallest prime that can be written in base 10 using just n n's. 2

%I

%S 2,13,223,2333,44449,555557,16666669,77767777,888888883,9199999999,

%T 1011010101010101010109,11111111111111111111117,

%U 12112121212121212121212127,131131313131313131313131313

%N a(n) = smallest prime that can be written in base 10 using just n n's.

%C For n > 9 the smallest prime obtained by inserting digits between the n's.

%e The smallest prime containing no 0's is 2, so a(0) = 2.

%K nonn,base

%O 0,1

%A _Amarnath Murthy_, Mar 24 2002

%E Edited, corrected and extended by _Robert G. Wilson v_, Mar 27 2002

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 May 15 18:26 EDT 2021. Contains 343920 sequences. (Running on oeis4.)