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 A177999 #13 Mar 22 2018 04:12:58 %S A177999 7,11,911,8111,16111,911111,1171111,71111111,131111111,1711111111, %T A177999 31111111111,311111111111,5111111111111,41111111111111, %U A177999 111151111111111,5111111111111111,11111611111111111,191111111111111111 %N A177999 Largest n digit prime with the most digits equal to 1. %C A177999 Select first for maximum number of 1's, then take the largest. %C A177999 In more detail: To get a(n), look at the list of all the n-digit primes. Suppose k is the maximum number of 1's of any number on the list. Throw out any prime on the list that does not contain k 1's. Then a(n) = maximal number that is left on the list. - _N. J. A. Sloane_, Mar 20 2018 %Y A177999 Cf. A004022, A037055, A105992, A178000. %K A177999 nonn,base %O A177999 1,1 %A A177999 _Lekraj Beedassy_, May 17 2010