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 A105992 #28 Apr 03 2023 10:36:10
%S A105992 101,113,131,151,181,191,211,311,811,911,1117,1151,1171,1181,1511,
%T A105992 1811,2111,4111,8111,10111,11113,11117,11119,11131,11161,11171,11311,
%U A105992 11411,16111,101111,111119,111121,111191,111211,111611,112111,113111,131111,311111,511111
%N A105992 Near-repunit primes.
%C A105992 According to the prime glossary "a near-repunit prime is a prime all but one of whose digits are 1." This would also include {2, 3, 5, 7, 13, 17, 19, 31, 41, 61 and 71}, but this sequence only lists terms with more than two digits. - _M. F. Hasler_, Feb 10 2020
%D A105992 C. Caldwell and H. Dubner, "The near repunit primes 1(n-k-1)01(1k)," J. Recreational Math., 27 (1995) 35-41.
%D A105992 Heleen, J. P., "More near-repunit primes 1(n-k-1)D(1)1(k), D=2,3, ..., 9," J. Recreational Math., 29:3 (1998) 190-195.
%H A105992 T. D. Noe, <a href="/A105992/b105992.txt">Table of n, a(n) for n = 1..1000</a>
%H A105992 Chris Caldwell, <a href="https://t5k.org/top20/page.php?id=15">The Top 20 Near-repdigit Primes</a>
%H A105992 Chris Caldwell, The Prime Glossary, <a href="https://t5k.org/glossary/xpage/nearrepunitprime.html">Near-repunit prime</a>
%e A105992 a(2)=113 is a term because 113 is a prime and all digits are 1 except one.
%t A105992 lst = {}; Do[r = (10^n - 1)/9; Do[AppendTo[lst, DeleteCases[Select[FromDigits[Permutations[Append[IntegerDigits[r], d]]], PrimeQ], r]], {d, 0, 9}], {n, 2, 14}]; Sort[Flatten[lst]] (* _Arkadiusz Wesolowski_, Sep 20 2011 *)
%Y A105992 Cf. A000042, A002275, A004022, A046053, A046413, A065074, A034093, A065083, A102782, A118505.
%K A105992 base,nonn
%O A105992 1,1
%A A105992 _Shyam Sunder Gupta_, Apr 29 2005