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.
%I A069569 #10 May 05 2024 08:56:52 %S A069569 2,13,223,2333,44449,555557,16666669,77767777,888888883,9199999999, %T A069569 1010101010010101010107,11111111111111111111111, %U A069569 12112121212121212121212127,131131313131313131313131313,141414014141414141414141414149,15151151515151515151515151515159 %N A069569 a(n) = smallest prime that can be written in base 10 using just n n's. %C A069569 For n > 9 the smallest prime obtained by inserting digits between the n's. %H A069569 Sean A. Irvine, <a href="/A069569/b069569.txt">Table of n, a(n) for n = 0..50</a> %e A069569 The smallest prime containing no 0's is 2, so a(0) = 2. %K A069569 nonn,base %O A069569 0,1 %A A069569 _Amarnath Murthy_, Mar 24 2002 %E A069569 Edited, corrected and extended by _Robert G. Wilson v_, Mar 27 2002 %E A069569 Further corrected and extended by _Sean A. Irvine_, May 05 2024