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 A181764 #40 Apr 25 2020 03:18:18
%S A181764 6,8,10,13,14,19,20,24,25,26,28,34,38,48,54,55,59,71,75,92,109,114,115
%N A181764 Numbers n such that n!+1 is a product of two distinct prime numbers.
%C A181764 n! + 1 must be the product of two distinct prime numbers and also the product of only two prime numbers counted with multiplicity. Thus, 12 is NOT a term of the sequence because 12! + 1 = 13*13*2834329. - _Harvey P. Dale_, Jul 22 2019
%C A181764 Other terms in this sequence: 392, 551, 601, 770, 772, 878, 1033, 1320, 1831, 2620, 2808, 3752, 4233, 4616, 4984, 7260. - _Chai Wah Wu_, Feb 28 2020
%H A181764 Bruce C. Berndt and William F. Galway, <a href="http://www.math.uiuc.edu/~berndt/articles/galway.pdf">On the Brocard-Ramanujan diophantine equation n!+1=m^2</a>, The Ramanujan Journal, March 2000, Volume 4, Issue 1, pp 41-42.
%e A181764 6!+1=7*103; 8!+1=61*661; 10!+1=11*329891; 13!+1=83*75024347; 14!+1=23*3790360487; 19!+1=71*1713311273363831;..
%t A181764 fQ[n_]:=Last/@FactorInteger[n]=={1,1}; Select[Range[40], fQ[#!+1]&]
%Y A181764 Cf. A033312, A038507, A078781, A085692, A085747, A088332.
%Y A181764 Subsequence of A078778.
%K A181764 nonn,more
%O A181764 1,1
%A A181764 _Vladimir Joseph Stephan Orlovsky_, Nov 13 2010
%E A181764 Extended by _D. S. McNeil_, Nov 13 2010
%E A181764 One more term (114) (factored by Womack et al.) from _Sean A. Irvine_, May 25 2015
%E A181764 One more term (115) (factored by Womack et al.) from _Sean A. Irvine_, Feb 08 2016