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 A071142 #19 Sep 30 2023 21:44:54
%S A071142 30,70,286,646,1798,3526,7198,10366,20806,23326,38086,44998,64798,
%T A071142 73726,78406,103966,115198,145798,159046,194686,242206,352798,373246,
%U A071142 426886,544966,649798,719998,763846,824326,871198,1312198,1351366,1371166,1472326,1555846
%N A071142 Numbers of the form 2*p*q where (p,q) is a twin prime pair.
%C A071142 For each term k, A008472(k)/A006530(k) = (2+p+q)/q = (q+q)/q = 2.
%H A071142 Donovan Johnson, <a href="/A071142/b071142.txt">Table of n, a(n) for n = 1..1000</a>
%F A071142 a(n) = 2*A037074(n).
%e A071142 a(1) = 2 * (product of 1st twin prime pair) = 2*3*5 = 30.
%t A071142 ffi[x_] := Flatten[FactorInteger[x]] lf[x_] := Length[FactorInteger[x]] ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}] sb[x_] := Apply[Plus, ba[x]] ma[x_] := Part[Reverse[Flatten[FactorInteger[x]]], 2] amo[x_] := Abs[MoebiusMu[x]] Do[s=sb[n]/ma[n]; If[IntegerQ[s]&&Equal[lf[n], 3]&& !Equal[amo[n], 0], Print[{n, ba[n]}]], {n, 2, 1000000}]
%Y A071142 Cf. A008472, A006530, A000961, A025475, A037074, A071139-A071147.
%K A071142 nonn
%O A071142 1,1
%A A071142 _Labos Elemer_, May 13 2002
%E A071142 Edited by _Jon E. Schoenfield_, Sep 30 2023