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 A276461 #15 Sep 26 2016 22:28:51
%S A276461 211,12211,21121,21211,22111,1121221,1212121,2121121,2211211,2221111,
%T A276461 111221221,112212211,112221211,121211221,211122211,211212121,
%U A276461 211222111,221112121,221212111,11122121221,11122221211,11211221221,11212211221,11212221121,11222112211
%N A276461 Prime numbers whose digits are k+1 1's and k 2's for some k >= 1.
%C A276461 The sequence is conjectured to be infinite.
%t A276461 Table[Select[Map[FromDigits, Permutations[ConstantArray[1, n + 1] ~Join~ ConstantArray[2, n], {2 n + 1}]], PrimeQ], {n, 5}] // Flatten (* _Michael De Vlieger_, Sep 04 2016 *)
%o A276461 (PARI) listp(nn) = { forprime(p=2, nn, d = digits(p); if ((vecmin(d) == 1) && (vecmax(d) == 2) && (#select(x->x==1, d) == #select(x->x==2, d) +1), print1(p, ", ");););} \\ _Michel Marcus_, Sep 04 2016
%Y A276461 Cf. A000040, A020450.
%K A276461 nonn,base
%O A276461 1,1
%A A276461 _Bob Selcoe_, Sep 03 2016