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 A087747 #23 Mar 18 2024 12:05:08
%S A087747 5,16,24,36,48,60,78,84,90,114,144,120,168,180,234,246,288,240,210,
%T A087747 324,300,360,474,330,528,576,390,462,480,420,570,510,672,792,756,876,
%U A087747 714,798,690,1038,630,1008,930,780,960,870,924,900,1134,1434,840,990,1302,1080,1230,1518
%N A087747 Least number expressible as a sum of two distinct primes in exactly n ways.
%H A087747 Paolo P. Lava, <a href="/A087747/b087747.txt">Table of n, a(n) for n = 1..1000</a>
%F A087747 a(n) = min({m >= 1 : A117929(m) = n}). - _Peter Munn_, May 01 2023
%e A087747 a(2)=16 because we have 16=3+13=5+11, followed by 18=5+13=7+11; 20=3+17=7+13; 22=3+19=5+17; 26=3+23=7+19;...
%t A087747 Module[{nn=2000,ip},ip=Table[{n,Length[Select[IntegerPartitions[n,{2}], #[[1]]!=#[[2]]&&AllTrue[#,PrimeQ]&]]},{n,nn}];Table[SelectFirst[ip, #[[2]]==k&],{k,60}]][[All,1]] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Jul 11 2020 *)
%Y A087747 Cf. A117929.
%K A087747 nonn
%O A087747 1,1
%A A087747 _Lekraj Beedassy_, Oct 02 2003
%E A087747 More terms from John Dethridge (jcd(AT)ms.unimelb.edu.au), Jan 08 2004
%E A087747 More terms from _Hugo Pfoertner_, Sep 23 2004
%E A087747 Reinserted a(18), a(19) and a(20) by _Paolo P. Lava_, May 26 2014