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 A075322 #19 Feb 12 2018 11:36:52
%S A075322 5,11,19,31,47,29,67,59,79,103,131,97,127,167,71,181,191,173,151,233,
%T A075322 239,223,257,277,313,251,281,163,389,353,373,347,307,337,419,431,457,
%U A075322 443,479,397,461,523,577,509,499,541,557,563
%N A075322 Pair the odd primes so that the k-th pair is (p, p+2n) where p is the smallest prime not included earlier such that p and p+2n are primes and p+2n also does not occur earlier: (3, 5), (7, 11), (13, 19), (23, 31), (37, 47), (17, 29), ... This is the sequence of the second member of every pair.
%C A075322 Question: Is every prime p a member of some pair?
%C A075322 a(n) = A075323(2*n).
%H A075322 Reinhard Zumkeller, <a href="/A075322/b075322.txt">Table of n, a(n) for n = 1..10000</a>
%F A075322 a(n) = A075321(n)+2*n.
%F A075322 a(n) = A075323(2*n).
%p A075322 # A075321p() implemented in A075321.
%p A075322 A075322 := proc(n)
%p A075322 op(2,A075321p(n)) ;
%p A075322 end proc:
%p A075322 seq(A075322(n),n=1..60) ; # _R. J. Mathar_, Nov 26 2014
%t A075322 A075321p[n_] := A075321p[n] = Module[{prevlist, i, p, q }, If[n == 1, Return[{3, 5}], prevlist = Array[A075321p, n - 1] // Flatten]; For[i = 2, True, i++, p = Prime[i]; If[FreeQ[prevlist, p], q = p + 2*n; If[PrimeQ[q] && FreeQ[ prevlist, q], Return[{p, q}]]]]];
%t A075322 a[n_] := A075321p[n][[2]];
%t A075322 Array[a, 50] (* _Jean-François Alcover_, Feb 12 2018, after _R. J. Mathar_ *)
%o A075322 (Haskell)
%o A075322 a075322 = a075323 . (* 2) -- _Reinhard Zumkeller_, Nov 29 2014
%Y A075322 Cf. A075321, A075323.
%K A075322 nonn
%O A075322 1,1
%A A075322 _Amarnath Murthy_, Sep 14 2002
%E A075322 Corrected by _R. J. Mathar_, Nov 26 2014