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 A057230 #22 May 26 2022 20:43:26
%S A057230 31,107,391,467,34049,67973,176413
%N A057230 Numbers k such that k = p+q = r+s with p*q = r*s = primorial number(A002110) (p*q) < (r*s).
%C A057230 The corresponding pairs of primorials are (3#, 4#), (4#, 5#), (5#, 6#), (5#, 6#), (7#, 9#), (8#, 9#), (8#, 10#). No other terms found up to 23#. - _Michel Marcus_, Feb 21 2016
%C A057230 a(8) > 3203982595205562774973. - _Sean A. Irvine_, May 26 2022
%H A057230 Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a057/A057230.java">Java program</a> (github)
%e A057230 31 = 30+1 = 21+10, where 30=30*1 and 210=21*10 are primorial numbers.
%o A057230 (PARI) isprimo(n) = {if (n==1, return (1)); if (!issquarefree(n), return(0)); f = factor(n); #f~ == primepi(vecmax(f[,1]));}
%o A057230 isok(n) = {c = 0; for (na=1, n\2, if (isprimo(na*(n - na)), c++); if (c == 2, return(1)););} \\ _Michel Marcus_, Feb 20 2016
%Y A057230 Cf. A002110, A006862, A182987.
%K A057230 nonn,more
%O A057230 1,1
%A A057230 _Naohiro Nomoto_, Sep 19 2000