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.

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

Original entry on oeis.org

2, 13, 223, 2333, 44449, 555557, 16666669, 77767777, 888888883, 9199999999, 1010101010010101010107, 11111111111111111111111, 12112121212121212121212127, 131131313131313131313131313, 141414014141414141414141414149, 15151151515151515151515151515159
Offset: 0

Views

Author

Amarnath Murthy, Mar 24 2002

Keywords

Comments

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

Examples

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

Extensions

Edited, corrected and extended by Robert G. Wilson v, Mar 27 2002
Further corrected and extended by Sean A. Irvine, May 05 2024