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 A108847 #23 Jan 31 2023 08:29:03
%S A108847 181,383,787,78887,9888889,188888881,3888888888883,188888888888881,
%T A108847 3888888888888888888888888888883,
%U A108847 18888888888888888888888888888888888888881
%N A108847 Palindromic primes in which all internal digits are 8.
%C A108847 a(27) has 1065 digits. - _Michael S. Branicky_, Jan 27 2023
%H A108847 Michael S. Branicky, <a href="/A108847/b108847.txt">Table of n, a(n) for n = 1..26</a>
%o A108847 (PARI) n10np1(n,d) = { local(x,y,k); for(x=1,n, for(k=1,9, y=10^(x+1)*k+floor(10^x*d/9)*10+k; if(isprime(y),print1(y",")) ) ) }
%o A108847 (Python)
%o A108847 from sympy import isprime
%o A108847 from itertools import count, islice
%o A108847 def agen(): yield from (t for i in count(1) for f in "1379" if isprime(t:=int(f + "8"*i + f)))
%o A108847 print(list(islice(agen(), 10))) # _Michael S. Branicky_, Jan 27 2023
%Y A108847 Similar sequences for digit d: A108845 (d=1), A108846 (d=2), A108841 (d=4), A108842 (d=5), A108843 (d=6), A108844 (d=7), A108848 (d=9).
%K A108847 easy,nonn,base
%O A108847 1,1
%A A108847 _Cino Hilliard_, Jul 11 2005
%E A108847 Name changed by _Arkadiusz Wesolowski_, Sep 07 2011
%E A108847 One comment moved to A068689 by _Michel Marcus_, Jan 28 2023