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 A096497 #18 Aug 11 2023 10:59:07
%S A096497 2,13,113,1117,11113,111119,1111151,11111117,111111113,1111111121,
%T A096497 11111111113,111111111149,1111111111139,11111111111123,
%U A096497 111111111111229,1111111111111123,11111111111111119,111111111111111131,1111111111111111171,11111111111111111131,111111111111111111157,1111111111111111111189
%N A096497 Prime following n-th repunit.
%C A096497 Not equal to A068693: first and 2nd terms differ.
%H A096497 Chai Wah Wu, <a href="/A096497/b096497.txt">Table of n, a(n) for n = 1..1000</a>
%F A096497 a(n) = A002275(n) + A096869(n) = A096498(n) + A096499(n).
%t A096497 Table[NextPrime[(10^n-1)/9], {n, 40}]
%t A096497 Table[NextPrime[FromDigits[PadRight[{},n,1]]],{n,30}] (* _Harvey P. Dale_, Aug 11 2023 *)
%o A096497 (PARI) a(n) = nextprime((10^n-1)/9 + 1); \\ _Michel Marcus_, May 02 2016
%o A096497 (Python)
%o A096497 from sympy import nextprime
%o A096497 def A096497(n):
%o A096497 return nextprime((10**n-1)//9) # _Chai Wah Wu_, Nov 04 2019
%Y A096497 Cf. A068693, A002275.
%K A096497 nonn
%O A096497 1,1
%A A096497 _Labos Elemer_, Jul 09 2004