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 A032683 #16 Sep 05 2022 02:05:56
%S A032683 1,5,7,8,16,20,25,31,32,34,37,41,43,46,53,58,59,61,62,64,67,73,79,80,
%T A032683 82,83,85,86,92,94,101,103,106,112,115,118,119,122,125,133,139,151,
%U A032683 154,157,158,164,166,172,179,187,188,196,197,200,206,208,214,217
%N A032683 Numbers k such that k surrounded by digit '3' is a prime.
%H A032683 Harvey P. Dale, <a href="/A032683/b032683.txt">Table of n, a(n) for n = 1..1000</a>
%t A032683 Select[Range[250],PrimeQ[FromDigits[Join[{3},IntegerDigits[#],{3}]]]&] (* _Harvey P. Dale_, Apr 18 2012 *)
%o A032683 (Python)
%o A032683 from sympy import isprime
%o A032683 def ok(n): return isprime(int('3' + str(n) + '3'))
%o A032683 print([k for k in range(220) if ok(k)]) # _Michael S. Branicky_, Sep 04 2022
%Y A032683 Cf. A032682, A032684, A032685, A032687.
%K A032683 nonn,base
%O A032683 1,2
%A A032683 _Patrick De Geest_, May 15 1998