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 A099268 #2 Mar 30 2012 17:31:06 %S A099268 0,11,2,3,0,5,0,7,0,0,101,0,0,0,0,0,0,0,0,211,13,41,151,61,17,181,19, %T A099268 23,0,0,0,227,0,29,43,53,0,37,83,0,0,0,47,0,499,0,557,0,59,67,0,0,787, %U A099268 79,89,1021,103,401,5101,601,701,8101,109,2003,0,0,0,2027,0,2029,4003,503 %N A099268 For each single digit {0,1,...,9} record the smallest prime made up of copies of that digit or 0 if no such prime exists; repeat for all of the C(10,2) = 45 pairs of distinct decimal digits; then for all triples; etc. %e A099268 There are no primes that consist of copies of the digit 4, or 6, or 8, or 9, or {0,2}, or {0,3}, etc. %Y A099268 Cf. A099651, A099756, A016112. %K A099268 base,nonn,easy,fini %O A099268 1,2 %A A099268 _Robert G. Wilson v_, Nov 16 2004