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 A356466 #10 Apr 25 2024 13:53:45
%S A356466 11,13,17,19,29,31,59,61,79,83,127,131,137,139,149,151,163,167,179,
%T A356466 181,191,193,197,199,239,241,331,337,347,349,397,401,419,421,431,433,
%U A356466 439,443,521,523,541,547,673,677,701,709,787,797,809,811,821,823,827,829
%N A356466 Prime numbers in the sublists defined in A348168 that contain exactly two primes.
%C A356466 Let g = q - p be the gap between a pair of primes in the sequence, g < p - previprime(p) and g < nextprime(q) - q.
%C A356466 It seems that lim_{n-> oo} n/primepi(a(n)) = 0.314 approximately.
%o A356466 (Python)
%o A356466 from sympy import nextprime; R = []; p0 = 2
%o A356466 while len(R) < 60:
%o A356466 p1 = nextprime(p0); M = [p1]; p = nextprime(p1); g1 = p - p1
%o A356466 while g1 < p1 - p0 and p - p1 <= g1: M.append(p); p1 = p; p = nextprime(p)
%o A356466 if len(M) == 2: R.extend(M)
%o A356466 p0 = p1
%o A356466 print(*R, sep = ', ')
%Y A356466 Cf. A348168.
%K A356466 nonn
%O A356466 1,1
%A A356466 _Ya-Ping Lu_, Aug 08 2022