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 A165570 #17 Nov 28 2019 06:14:13
%S A165570 6,15,77,589,851,1363,15229,201563,512893,644251,1366553,3416003,
%T A165570 7881197,377331139,400711231,2963563859,4035221017,28862500577,
%U A165570 52027213697,133793658289,418298061641,1363588753103,1970239102459,6355462656397,136388198153719,465337655023099
%N A165570 Successively better golden semiprimes.
%C A165570 This is lexicographically earliest sequence of such semiprimes p*q, starting from 6=2*3, that for each successive term p*q, q/p is a better approximant of Golden ratio (1+sqrt(5))/2 than the previous term. See A165569 for the exact procedure.
%C A165570 Can it be proved that this a subset of A108540?
%C A165570 The ratio A165572(n)/A165571(n) converges towards golden ratio = (1+sqrt(5))/2 = 1.618033988749895... as: 1.5, 1.6666666666666667, 1.5714285714285714, 1.631578947368421, 1.608695652173913, 1.6206896551724137, 1.6185567010309279, 1.6175637393767706, 1.6181172291296626, 1.618066561014263, 1.618063112078346, 1.618031658637302, 1.6180335296782964, 1.6180341824372995, 1.6180339327699054, ...
%H A165570 Amiram Eldar, <a href="/A165570/b165570.txt">Table of n, a(n) for n = 1..48</a>
%F A165570 a(n) = A165571(n)*A165572(n) = A000040(A165569(n))*A108539(A165569(n)).
%t A165570 f[p_] := Module[{x = GoldenRatio * p, p1, p2}, p1 = NextPrime[x, -1]; p2 = NextPrime[p1]; If[p2 - x > x - p1, p1, p2]]; seq={}; dm = 1; p1 = 1; Do[p1 = NextPrime[p1]; k++; p2 = f[p1]; d = Abs[p2/p1 - GoldenRatio]; If[d < dm, dm = d; AppendTo[seq, p1*p2]], {10^4}]; seq (* _Amiram Eldar_, Nov 28 2019 *)
%Y A165570 Cf. A108539, A165569, A165571, A165572.
%K A165570 nonn
%O A165570 1,1
%A A165570 _Antti Karttunen_, Sep 22 2009
%E A165570 a(16)-a(23) from _Donovan Johnson_, May 13 2010
%E A165570 a(24)-a(26) from _Amiram Eldar_, Nov 28 2019