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 A068814 #14 Jan 17 2019 13:44:05
%S A068814 2,211,2111,2111111111111,2111111111111111111,
%T A068814 211111111111111111111111,
%U A068814 2111111111111111111111111111111111111111111111111111111111,211111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111
%N A068814 Primes with a 2 followed by (possibly zero) 1's.
%C A068814 Primes of the form (19*10^n-1)/9.
%C A068814 The next term (a(9)) has 544 digits. _Harvey P. Dale_, Sep 28 2015
%H A068814 Makoto Kamada, <a href="https://stdkmd.net/nrr/2/21111.htm#prime">Prime numbers of the form 211...11</a>.
%H A068814 <a href="/index/Pri#Pri_rep">Index entries for primes involving repunits</a>
%F A068814 a(n) = (19*10^A056700(n)-1)/9.
%t A068814 Select[Table[FromDigits[Join[{2},PadRight[{},n,1]]],{n,0,130}],PrimeQ] (* _Harvey P. Dale_, Sep 28 2015 *)
%o A068814 (PARI) for(n=0,200, if(isprime(2*10^n+(10^(n)-1)/9)==1,print1(2*10^n+(10^(n)-1)/9,",")))
%Y A068814 Cf. A056700.
%K A068814 nonn
%O A068814 1,1
%A A068814 _Amarnath Murthy_, Mar 07 2002
%E A068814 More terms from _Benoit Cloitre_, Mar 09 2002
%E A068814 Edited by _Ray Chandler_, Feb 03 2012