login
This site is supported by donations to The OEIS 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
2, 13, 223, 2333, 44449, 555557, 16666669, 77767777, 888888883, 9199999999, 1011010101010101010109, 11111111111111111111117, 12112121212121212121212127, 131131313131313131313131313 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

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

LINKS

Table of n, a(n) for n=0..13.

EXAMPLE

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

CROSSREFS

Sequence in context: A227746 A078702 A259795 * A255882 A015196 A236903

Adjacent sequences:  A069566 A069567 A069568 * A069570 A069571 A069572

KEYWORD

nonn,base

AUTHOR

Amarnath Murthy, Mar 24 2002

EXTENSIONS

Edited, corrected and extended by Robert G. Wilson v, Mar 27 2002

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 12:13 EST 2019. Contains 319363 sequences. (Running on oeis4.)