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 A347344 #32 Oct 02 2021 15:02:39
%S A347344 1,13,23,27,29,31,37,43,49,57,61,73,81,83,87,91,97,103,109,117,123,
%T A347344 129,151,153,163,171,181,187,193,203,207,213,221,237,239,243,251,267,
%U A347344 269,273,281,287,293,297,301,307,313,319,323,329,331,343,347,359,361
%N A347344 Positive integers k such that k with the first (most significant) digit repeated is prime.
%C A347344 Conjecture: the sequence contains infinitely many twin prime pairs (k, k+2) such that (D(k), D(k+2)) is a twin prime pair, where D(x) = x with the most significant digit repeated. The first such k is 659: both (659, 661) and (6659, 6661) are twin prime pairs. All these k begin with either 3, 6, or 9.
%H A347344 Michael S. Branicky, <a href="/A347344/b347344.txt">Table of n, a(n) for n = 1..10000</a>
%e A347344 27 is a term because 227 is prime.
%t A347344 upto=500;Select[Range[1,upto,2],PrimeQ[FromDigits[Join[{First[d=IntegerDigits[#]]},d]]]&]
%o A347344 (Python)
%o A347344 from sympy import isprime
%o A347344 def ok(n): s = str(n); return isprime(int(s[0] + s))
%o A347344 print(list(filter(ok, range(362)))) # _Michael S. Branicky_, Aug 27 2021
%o A347344 (PARI) isok(k) = my(d=digits(k)); isprime(eval(fromdigits(concat(d[1], d)))); \\ _Michel Marcus_, Sep 09 2021
%Y A347344 Cf. A000040, A226099, A347343.
%K A347344 nonn,base
%O A347344 1,2
%A A347344 _Paolo Xausa_, Aug 27 2021